./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash efe93c285b9cfe4b236eb7cc9957c6e5b1b94bff3322775b8e8d61a9769c319e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:20:54,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:20:54,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:20:54,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:20:54,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:20:54,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:20:54,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:20:54,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:20:54,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:20:54,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:20:54,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:20:54,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:20:54,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:20:54,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:20:54,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:20:54,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:20:54,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:20:54,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:20:54,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:20:54,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:20:54,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:20:54,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:20:54,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:20:54,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:20:54,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:20:54,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:20:54,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:20:54,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:20:54,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:20:54,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:20:54,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:20:54,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:20:54,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:20:54,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:20:54,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:20:54,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:20:54,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:20:54,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:20:54,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:20:54,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:20:54,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:20:54,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:20:54,113 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:20:54,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:20:54,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:20:54,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:20:54,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:20:54,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:20:54,115 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:20:54,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:20:54,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:20:54,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:20:54,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:20:54,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:20:54,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:20:54,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:20:54,117 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:20:54,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:20:54,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:20:54,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:20:54,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:20:54,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:20:54,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:20:54,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:20:54,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:20:54,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:20:54,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:20:54,119 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:20:54,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:20:54,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:20:54,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:20:54,120 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efe93c285b9cfe4b236eb7cc9957c6e5b1b94bff3322775b8e8d61a9769c319e [2021-11-22 19:20:54,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:20:54,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:20:54,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:20:54,349 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:20:54,351 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:20:54,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i [2021-11-22 19:20:54,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4fdc74b/a2d3533cb08e486f8e179c50875211d6/FLAG6b8302362 [2021-11-22 19:20:55,115 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:20:55,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i [2021-11-22 19:20:55,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4fdc74b/a2d3533cb08e486f8e179c50875211d6/FLAG6b8302362 [2021-11-22 19:20:55,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4fdc74b/a2d3533cb08e486f8e179c50875211d6 [2021-11-22 19:20:55,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:20:55,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:20:55,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:20:55,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:20:55,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:20:55,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:20:55" (1/1) ... [2021-11-22 19:20:55,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1edc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:55, skipping insertion in model container [2021-11-22 19:20:55,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:20:55" (1/1) ... [2021-11-22 19:20:55,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:20:55,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:20:55,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4489,4502] [2021-11-22 19:20:55,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4549,4562] [2021-11-22 19:20:56,145 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,155 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,156 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,159 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,160 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,168 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,168 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,171 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,405 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:20:56,409 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:20:56,419 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:20:56,420 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:20:56,421 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:20:56,421 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:20:56,422 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:20:56,422 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:20:56,423 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:20:56,423 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:20:56,529 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:20:56,629 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,629 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:20:56,760 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:20:56,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4489,4502] [2021-11-22 19:20:56,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4549,4562] [2021-11-22 19:20:56,813 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,814 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,815 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,816 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,817 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,827 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,829 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,830 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,831 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,895 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:20:56,896 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:20:56,897 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:20:56,897 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:20:56,898 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:20:56,898 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:20:56,899 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:20:56,899 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:20:56,900 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:20:56,902 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:20:56,922 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:20:56,973 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:56,974 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:20:57,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:20:57,197 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:20:57,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57 WrapperNode [2021-11-22 19:20:57,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:20:57,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:20:57,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:20:57,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:20:57,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,392 INFO L137 Inliner]: procedures = 691, calls = 2666, calls flagged for inlining = 963, calls inlined = 64, statements flattened = 1551 [2021-11-22 19:20:57,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:20:57,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:20:57,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:20:57,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:20:57,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:20:57,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:20:57,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:20:57,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:20:57,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (1/1) ... [2021-11-22 19:20:57,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:20:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:20:57,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 19:20:57,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 19:20:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-22 19:20:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:20:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:20:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:20:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:20:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:20:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:20:57,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:20:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:20:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:20:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:20:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:20:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:20:57,861 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:20:57,862 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:20:59,074 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:20:59,083 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:20:59,083 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 19:20:59,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:20:59 BoogieIcfgContainer [2021-11-22 19:20:59,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:20:59,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:20:59,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:20:59,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:20:59,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:20:55" (1/3) ... [2021-11-22 19:20:59,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112f3ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:20:59, skipping insertion in model container [2021-11-22 19:20:59,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:20:57" (2/3) ... [2021-11-22 19:20:59,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112f3ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:20:59, skipping insertion in model container [2021-11-22 19:20:59,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:20:59" (3/3) ... [2021-11-22 19:20:59,091 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_harness.i [2021-11-22 19:20:59,095 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:20:59,095 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-11-22 19:20:59,137 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:20:59,142 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 19:20:59,142 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-11-22 19:20:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 262 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 19:20:59,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:59,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:59,172 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:20:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash 853988342, now seen corresponding path program 1 times [2021-11-22 19:20:59,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:59,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709992906] [2021-11-22 19:20:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:59,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:20:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:20:59,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:20:59,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709992906] [2021-11-22 19:20:59,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709992906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:20:59,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:20:59,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:20:59,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068697076] [2021-11-22 19:20:59,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:20:59,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:20:59,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:20:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:20:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:20:59,701 INFO L87 Difference]: Start difference. First operand has 263 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 262 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:20:59,765 INFO L93 Difference]: Finished difference Result 522 states and 723 transitions. [2021-11-22 19:20:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:20:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-11-22 19:20:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:20:59,781 INFO L225 Difference]: With dead ends: 522 [2021-11-22 19:20:59,782 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 19:20:59,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:20:59,795 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:20:59,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:20:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 19:20:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-22 19:20:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 255 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 324 transitions. [2021-11-22 19:20:59,843 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 324 transitions. Word has length 45 [2021-11-22 19:20:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:20:59,843 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 324 transitions. [2021-11-22 19:20:59,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:20:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 324 transitions. [2021-11-22 19:20:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 19:20:59,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:20:59,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:20:59,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:20:59,847 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:20:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:20:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash 584470840, now seen corresponding path program 1 times [2021-11-22 19:20:59,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:20:59,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115739299] [2021-11-22 19:20:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:20:59,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:20:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:00,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:00,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115739299] [2021-11-22 19:21:00,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115739299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:00,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:00,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:21:00,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448657215] [2021-11-22 19:21:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:00,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:21:00,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:21:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:21:00,094 INFO L87 Difference]: Start difference. First operand 256 states and 324 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:00,204 INFO L93 Difference]: Finished difference Result 486 states and 614 transitions. [2021-11-22 19:21:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:21:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-11-22 19:21:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:00,206 INFO L225 Difference]: With dead ends: 486 [2021-11-22 19:21:00,207 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 19:21:00,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:21:00,210 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 449 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:00,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 450 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:21:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 19:21:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-22 19:21:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 239 states have (on average 1.3430962343096233) internal successors, (321), 255 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 321 transitions. [2021-11-22 19:21:00,225 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 321 transitions. Word has length 45 [2021-11-22 19:21:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:00,225 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 321 transitions. [2021-11-22 19:21:00,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 321 transitions. [2021-11-22 19:21:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 19:21:00,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:00,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:00,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:21:00,228 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash -713327456, now seen corresponding path program 1 times [2021-11-22 19:21:00,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790198801] [2021-11-22 19:21:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:00,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:00,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790198801] [2021-11-22 19:21:00,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790198801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:00,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:00,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:21:00,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459380572] [2021-11-22 19:21:00,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:00,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:21:00,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:21:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:21:00,420 INFO L87 Difference]: Start difference. First operand 256 states and 321 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:00,555 INFO L93 Difference]: Finished difference Result 567 states and 722 transitions. [2021-11-22 19:21:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:21:00,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-22 19:21:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:00,557 INFO L225 Difference]: With dead ends: 567 [2021-11-22 19:21:00,557 INFO L226 Difference]: Without dead ends: 336 [2021-11-22 19:21:00,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:21:00,561 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 178 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:00,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 861 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:21:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-22 19:21:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 272. [2021-11-22 19:21:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 255 states have (on average 1.3215686274509804) internal successors, (337), 271 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 337 transitions. [2021-11-22 19:21:00,581 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 337 transitions. Word has length 57 [2021-11-22 19:21:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:00,582 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 337 transitions. [2021-11-22 19:21:00,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 337 transitions. [2021-11-22 19:21:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 19:21:00,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:00,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:00,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:21:00,585 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash -961473950, now seen corresponding path program 1 times [2021-11-22 19:21:00,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517310464] [2021-11-22 19:21:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:00,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:00,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517310464] [2021-11-22 19:21:00,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517310464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:00,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:00,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:21:00,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807961560] [2021-11-22 19:21:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:00,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:21:00,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:00,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:21:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:21:00,781 INFO L87 Difference]: Start difference. First operand 272 states and 337 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:00,920 INFO L93 Difference]: Finished difference Result 409 states and 499 transitions. [2021-11-22 19:21:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:21:00,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-22 19:21:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:00,922 INFO L225 Difference]: With dead ends: 409 [2021-11-22 19:21:00,923 INFO L226 Difference]: Without dead ends: 272 [2021-11-22 19:21:00,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:21:00,925 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 641 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:00,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 528 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:21:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-22 19:21:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-22 19:21:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 255 states have (on average 1.3176470588235294) internal successors, (336), 271 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 336 transitions. [2021-11-22 19:21:00,938 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 336 transitions. Word has length 57 [2021-11-22 19:21:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:00,939 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 336 transitions. [2021-11-22 19:21:00,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 336 transitions. [2021-11-22 19:21:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-22 19:21:00,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:00,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:00,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:21:00,941 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1999495063, now seen corresponding path program 1 times [2021-11-22 19:21:00,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:00,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64240020] [2021-11-22 19:21:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:00,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:01,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:01,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64240020] [2021-11-22 19:21:01,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64240020] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:01,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:01,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:21:01,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101753499] [2021-11-22 19:21:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:01,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:21:01,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:01,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:21:01,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:21:01,181 INFO L87 Difference]: Start difference. First operand 272 states and 336 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:01,290 INFO L93 Difference]: Finished difference Result 484 states and 596 transitions. [2021-11-22 19:21:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:21:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-22 19:21:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:01,293 INFO L225 Difference]: With dead ends: 484 [2021-11-22 19:21:01,293 INFO L226 Difference]: Without dead ends: 272 [2021-11-22 19:21:01,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:21:01,294 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 645 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:01,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 521 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:21:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-22 19:21:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-22 19:21:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 255 states have (on average 1.3019607843137255) internal successors, (332), 271 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 332 transitions. [2021-11-22 19:21:01,302 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 332 transitions. Word has length 63 [2021-11-22 19:21:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:01,305 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 332 transitions. [2021-11-22 19:21:01,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 332 transitions. [2021-11-22 19:21:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:21:01,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:01,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:01,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:21:01,310 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1395943106, now seen corresponding path program 1 times [2021-11-22 19:21:01,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:01,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218914551] [2021-11-22 19:21:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:01,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:01,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:01,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218914551] [2021-11-22 19:21:01,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218914551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:01,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:01,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:21:01,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470435390] [2021-11-22 19:21:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:01,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:21:01,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:21:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:21:01,542 INFO L87 Difference]: Start difference. First operand 272 states and 332 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:01,778 INFO L93 Difference]: Finished difference Result 482 states and 571 transitions. [2021-11-22 19:21:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:21:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-11-22 19:21:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:01,780 INFO L225 Difference]: With dead ends: 482 [2021-11-22 19:21:01,780 INFO L226 Difference]: Without dead ends: 474 [2021-11-22 19:21:01,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:21:01,781 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 389 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:01,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 1203 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:21:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-22 19:21:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 288. [2021-11-22 19:21:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 271 states have (on average 1.2841328413284132) internal successors, (348), 287 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 348 transitions. [2021-11-22 19:21:01,789 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 348 transitions. Word has length 69 [2021-11-22 19:21:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:01,790 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 348 transitions. [2021-11-22 19:21:01,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 348 transitions. [2021-11-22 19:21:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 19:21:01,791 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:01,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:01,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:21:01,791 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1397944122, now seen corresponding path program 1 times [2021-11-22 19:21:01,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:01,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772370896] [2021-11-22 19:21:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:01,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:02,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772370896] [2021-11-22 19:21:02,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772370896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:02,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:02,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:21:02,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008839527] [2021-11-22 19:21:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:02,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:21:02,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:02,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:21:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:21:02,282 INFO L87 Difference]: Start difference. First operand 288 states and 348 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:03,748 INFO L93 Difference]: Finished difference Result 827 states and 1009 transitions. [2021-11-22 19:21:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:21:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-11-22 19:21:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:03,751 INFO L225 Difference]: With dead ends: 827 [2021-11-22 19:21:03,751 INFO L226 Difference]: Without dead ends: 676 [2021-11-22 19:21:03,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:21:03,752 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 713 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:03,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 2289 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:21:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-11-22 19:21:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 338. [2021-11-22 19:21:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 321 states have (on average 1.2897196261682242) internal successors, (414), 337 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 414 transitions. [2021-11-22 19:21:03,765 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 414 transitions. Word has length 73 [2021-11-22 19:21:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:03,765 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 414 transitions. [2021-11-22 19:21:03,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 414 transitions. [2021-11-22 19:21:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 19:21:03,766 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:03,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:03,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:21:03,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2078002492, now seen corresponding path program 1 times [2021-11-22 19:21:03,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:03,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110447587] [2021-11-22 19:21:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:03,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:04,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:04,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110447587] [2021-11-22 19:21:04,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110447587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:04,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:04,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:21:04,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327609967] [2021-11-22 19:21:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:04,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:21:04,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:21:04,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:21:04,344 INFO L87 Difference]: Start difference. First operand 338 states and 414 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:07,076 INFO L93 Difference]: Finished difference Result 1881 states and 2239 transitions. [2021-11-22 19:21:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-22 19:21:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-11-22 19:21:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:07,081 INFO L225 Difference]: With dead ends: 1881 [2021-11-22 19:21:07,082 INFO L226 Difference]: Without dead ends: 1710 [2021-11-22 19:21:07,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2021-11-22 19:21:07,083 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 2403 mSDsluCounter, 3796 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2403 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:07,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2403 Valid, 4038 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-22 19:21:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-11-22 19:21:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 397. [2021-11-22 19:21:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 380 states have (on average 1.2921052631578946) internal successors, (491), 396 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 491 transitions. [2021-11-22 19:21:07,103 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 491 transitions. Word has length 73 [2021-11-22 19:21:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:07,103 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 491 transitions. [2021-11-22 19:21:07,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 491 transitions. [2021-11-22 19:21:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-22 19:21:07,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:07,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:07,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:21:07,105 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -6399349, now seen corresponding path program 1 times [2021-11-22 19:21:07,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:07,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236594871] [2021-11-22 19:21:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:07,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:07,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:07,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236594871] [2021-11-22 19:21:07,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236594871] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:07,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:07,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:21:07,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512068263] [2021-11-22 19:21:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:07,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:21:07,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:07,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:21:07,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:21:07,659 INFO L87 Difference]: Start difference. First operand 397 states and 491 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:08,184 INFO L93 Difference]: Finished difference Result 1146 states and 1428 transitions. [2021-11-22 19:21:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:21:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-11-22 19:21:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:08,187 INFO L225 Difference]: With dead ends: 1146 [2021-11-22 19:21:08,187 INFO L226 Difference]: Without dead ends: 789 [2021-11-22 19:21:08,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:21:08,189 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 1452 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:08,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1452 Valid, 1683 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:21:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-11-22 19:21:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 397. [2021-11-22 19:21:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 396 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 490 transitions. [2021-11-22 19:21:08,205 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 490 transitions. Word has length 74 [2021-11-22 19:21:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:08,205 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 490 transitions. [2021-11-22 19:21:08,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 490 transitions. [2021-11-22 19:21:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 19:21:08,207 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:08,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:08,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:21:08,207 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:08,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2073959282, now seen corresponding path program 1 times [2021-11-22 19:21:08,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:08,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926832798] [2021-11-22 19:21:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:08,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:08,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:08,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926832798] [2021-11-22 19:21:08,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926832798] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:08,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:08,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:21:08,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168028814] [2021-11-22 19:21:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:08,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:21:08,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:08,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:21:08,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:21:08,459 INFO L87 Difference]: Start difference. First operand 397 states and 490 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:08,717 INFO L93 Difference]: Finished difference Result 898 states and 1080 transitions. [2021-11-22 19:21:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:21:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-11-22 19:21:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:08,719 INFO L225 Difference]: With dead ends: 898 [2021-11-22 19:21:08,720 INFO L226 Difference]: Without dead ends: 497 [2021-11-22 19:21:08,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:21:08,721 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 174 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:08,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 1986 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:21:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-22 19:21:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 397. [2021-11-22 19:21:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 380 states have (on average 1.2657894736842106) internal successors, (481), 396 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 481 transitions. [2021-11-22 19:21:08,738 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 481 transitions. Word has length 77 [2021-11-22 19:21:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:08,738 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 481 transitions. [2021-11-22 19:21:08,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 481 transitions. [2021-11-22 19:21:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-22 19:21:08,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:08,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:08,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:21:08,740 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1658464275, now seen corresponding path program 1 times [2021-11-22 19:21:08,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:08,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111743503] [2021-11-22 19:21:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:08,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:09,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111743503] [2021-11-22 19:21:09,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111743503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:09,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:09,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:21:09,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964008426] [2021-11-22 19:21:09,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:09,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:21:09,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:09,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:21:09,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:21:09,220 INFO L87 Difference]: Start difference. First operand 397 states and 481 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:13,851 INFO L93 Difference]: Finished difference Result 3431 states and 4121 transitions. [2021-11-22 19:21:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-11-22 19:21:13,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2021-11-22 19:21:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:13,862 INFO L225 Difference]: With dead ends: 3431 [2021-11-22 19:21:13,862 INFO L226 Difference]: Without dead ends: 3260 [2021-11-22 19:21:13,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2715 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1433, Invalid=5877, Unknown=0, NotChecked=0, Total=7310 [2021-11-22 19:21:13,866 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 9582 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9582 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:13,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9582 Valid, 3206 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-22 19:21:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2021-11-22 19:21:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 414. [2021-11-22 19:21:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 397 states have (on average 1.2594458438287153) internal successors, (500), 413 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 500 transitions. [2021-11-22 19:21:13,892 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 500 transitions. Word has length 79 [2021-11-22 19:21:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:13,892 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 500 transitions. [2021-11-22 19:21:13,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 500 transitions. [2021-11-22 19:21:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 19:21:13,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:13,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:13,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:21:13,894 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash 127247866, now seen corresponding path program 1 times [2021-11-22 19:21:13,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225969963] [2021-11-22 19:21:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:13,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:14,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:14,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225969963] [2021-11-22 19:21:14,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225969963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:14,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:14,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:21:14,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486982100] [2021-11-22 19:21:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:14,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:21:14,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:21:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:21:14,088 INFO L87 Difference]: Start difference. First operand 414 states and 500 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:14,474 INFO L93 Difference]: Finished difference Result 1267 states and 1519 transitions. [2021-11-22 19:21:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:21:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-11-22 19:21:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:14,478 INFO L225 Difference]: With dead ends: 1267 [2021-11-22 19:21:14,478 INFO L226 Difference]: Without dead ends: 876 [2021-11-22 19:21:14,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:21:14,480 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 727 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:14,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [727 Valid, 812 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:21:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-11-22 19:21:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 486. [2021-11-22 19:21:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 469 states have (on average 1.2579957356076759) internal successors, (590), 485 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 590 transitions. [2021-11-22 19:21:14,497 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 590 transitions. Word has length 80 [2021-11-22 19:21:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:14,497 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 590 transitions. [2021-11-22 19:21:14,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 590 transitions. [2021-11-22 19:21:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 19:21:14,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:14,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:14,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:21:14,499 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash 806520120, now seen corresponding path program 1 times [2021-11-22 19:21:14,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:14,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997013900] [2021-11-22 19:21:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:14,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:14,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:14,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997013900] [2021-11-22 19:21:14,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997013900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:14,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:14,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:21:14,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490220722] [2021-11-22 19:21:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:14,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:21:14,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:21:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:21:14,598 INFO L87 Difference]: Start difference. First operand 486 states and 590 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:14,713 INFO L93 Difference]: Finished difference Result 989 states and 1195 transitions. [2021-11-22 19:21:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:21:14,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-11-22 19:21:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:14,716 INFO L225 Difference]: With dead ends: 989 [2021-11-22 19:21:14,716 INFO L226 Difference]: Without dead ends: 492 [2021-11-22 19:21:14,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:21:14,720 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 37 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:14,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 830 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:21:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-11-22 19:21:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 466. [2021-11-22 19:21:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 449 states have (on average 1.21826280623608) internal successors, (547), 465 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 547 transitions. [2021-11-22 19:21:14,736 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 547 transitions. Word has length 80 [2021-11-22 19:21:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:14,736 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 547 transitions. [2021-11-22 19:21:14,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 547 transitions. [2021-11-22 19:21:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-22 19:21:14,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:14,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:14,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:21:14,740 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1088905860, now seen corresponding path program 1 times [2021-11-22 19:21:14,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:14,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071642644] [2021-11-22 19:21:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:14,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:15,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:15,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071642644] [2021-11-22 19:21:15,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071642644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:15,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:15,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:21:15,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420094018] [2021-11-22 19:21:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:15,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:21:15,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:21:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:21:15,527 INFO L87 Difference]: Start difference. First operand 466 states and 547 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:16,499 INFO L93 Difference]: Finished difference Result 1580 states and 1868 transitions. [2021-11-22 19:21:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:21:16,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-11-22 19:21:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:16,506 INFO L225 Difference]: With dead ends: 1580 [2021-11-22 19:21:16,506 INFO L226 Difference]: Without dead ends: 1289 [2021-11-22 19:21:16,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2021-11-22 19:21:16,508 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 2128 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:16,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2128 Valid, 2252 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:21:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2021-11-22 19:21:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 670. [2021-11-22 19:21:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 653 states have (on average 1.222052067381317) internal successors, (798), 669 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 798 transitions. [2021-11-22 19:21:16,533 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 798 transitions. Word has length 80 [2021-11-22 19:21:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:16,533 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 798 transitions. [2021-11-22 19:21:16,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 798 transitions. [2021-11-22 19:21:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:21:16,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:16,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:16,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:21:16,536 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 310196439, now seen corresponding path program 1 times [2021-11-22 19:21:16,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:16,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683974080] [2021-11-22 19:21:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:16,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:16,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:16,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683974080] [2021-11-22 19:21:16,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683974080] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:16,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:16,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:21:16,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128966962] [2021-11-22 19:21:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:16,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:21:16,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:21:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:21:16,937 INFO L87 Difference]: Start difference. First operand 670 states and 798 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:18,123 INFO L93 Difference]: Finished difference Result 2326 states and 2741 transitions. [2021-11-22 19:21:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-22 19:21:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-22 19:21:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:18,129 INFO L225 Difference]: With dead ends: 2326 [2021-11-22 19:21:18,129 INFO L226 Difference]: Without dead ends: 1991 [2021-11-22 19:21:18,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:21:18,131 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 2481 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2481 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:18,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2481 Valid, 2475 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:21:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2021-11-22 19:21:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 692. [2021-11-22 19:21:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 675 states have (on average 1.2177777777777778) internal successors, (822), 691 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 822 transitions. [2021-11-22 19:21:18,168 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 822 transitions. Word has length 83 [2021-11-22 19:21:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:18,168 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 822 transitions. [2021-11-22 19:21:18,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 822 transitions. [2021-11-22 19:21:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:21:18,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:18,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:18,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:21:18,170 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2087837277, now seen corresponding path program 1 times [2021-11-22 19:21:18,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:18,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586535611] [2021-11-22 19:21:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:18,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:18,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:18,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586535611] [2021-11-22 19:21:18,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586535611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:18,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:18,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:21:18,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398325976] [2021-11-22 19:21:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:18,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:21:18,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:18,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:21:18,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:21:18,517 INFO L87 Difference]: Start difference. First operand 692 states and 822 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:19,597 INFO L93 Difference]: Finished difference Result 2342 states and 2751 transitions. [2021-11-22 19:21:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:21:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-22 19:21:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:19,604 INFO L225 Difference]: With dead ends: 2342 [2021-11-22 19:21:19,604 INFO L226 Difference]: Without dead ends: 2012 [2021-11-22 19:21:19,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:21:19,606 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 1539 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:19,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1539 Valid, 2717 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:21:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2021-11-22 19:21:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 696. [2021-11-22 19:21:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 679 states have (on average 1.2164948453608246) internal successors, (826), 695 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 826 transitions. [2021-11-22 19:21:19,637 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 826 transitions. Word has length 83 [2021-11-22 19:21:19,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:19,637 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 826 transitions. [2021-11-22 19:21:19,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 826 transitions. [2021-11-22 19:21:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:21:19,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:19,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:19,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:21:19,639 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 989468693, now seen corresponding path program 1 times [2021-11-22 19:21:19,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:19,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81549722] [2021-11-22 19:21:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:19,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:20,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81549722] [2021-11-22 19:21:20,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81549722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:20,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:20,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:21:20,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049466677] [2021-11-22 19:21:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:20,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:21:20,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:21:20,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:21:20,490 INFO L87 Difference]: Start difference. First operand 696 states and 826 transitions. Second operand has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:26,483 INFO L93 Difference]: Finished difference Result 5357 states and 6315 transitions. [2021-11-22 19:21:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-22 19:21:26,484 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-22 19:21:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:26,498 INFO L225 Difference]: With dead ends: 5357 [2021-11-22 19:21:26,498 INFO L226 Difference]: Without dead ends: 4988 [2021-11-22 19:21:26,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1166, Invalid=4686, Unknown=0, NotChecked=0, Total=5852 [2021-11-22 19:21:26,501 INFO L933 BasicCegarLoop]: 1009 mSDtfsCounter, 5754 mSDsluCounter, 8803 mSDsCounter, 0 mSdLazyCounter, 4394 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5754 SdHoareTripleChecker+Valid, 9812 SdHoareTripleChecker+Invalid, 4583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 4394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:26,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5754 Valid, 9812 Invalid, 4583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 4394 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-22 19:21:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-11-22 19:21:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 911. [2021-11-22 19:21:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 894 states have (on average 1.1935123042505593) internal successors, (1067), 910 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1067 transitions. [2021-11-22 19:21:26,582 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1067 transitions. Word has length 83 [2021-11-22 19:21:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:26,582 INFO L470 AbstractCegarLoop]: Abstraction has 911 states and 1067 transitions. [2021-11-22 19:21:26,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1067 transitions. [2021-11-22 19:21:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-22 19:21:26,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:26,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:26,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:21:26,584 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1408565023, now seen corresponding path program 1 times [2021-11-22 19:21:26,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:26,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791989706] [2021-11-22 19:21:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:26,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:27,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791989706] [2021-11-22 19:21:27,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791989706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:27,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:27,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:21:27,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980423817] [2021-11-22 19:21:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:27,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:21:27,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:21:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:21:27,031 INFO L87 Difference]: Start difference. First operand 911 states and 1067 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:28,419 INFO L93 Difference]: Finished difference Result 2693 states and 3169 transitions. [2021-11-22 19:21:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:21:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-11-22 19:21:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:28,425 INFO L225 Difference]: With dead ends: 2693 [2021-11-22 19:21:28,425 INFO L226 Difference]: Without dead ends: 2363 [2021-11-22 19:21:28,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:21:28,426 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 1798 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1798 SdHoareTripleChecker+Valid, 3857 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:28,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1798 Valid, 3857 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 19:21:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2021-11-22 19:21:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 911. [2021-11-22 19:21:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 894 states have (on average 1.191275167785235) internal successors, (1065), 910 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1065 transitions. [2021-11-22 19:21:28,488 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1065 transitions. Word has length 83 [2021-11-22 19:21:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:28,488 INFO L470 AbstractCegarLoop]: Abstraction has 911 states and 1065 transitions. [2021-11-22 19:21:28,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1065 transitions. [2021-11-22 19:21:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:21:28,490 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:28,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:28,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:21:28,491 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1730346714, now seen corresponding path program 1 times [2021-11-22 19:21:28,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193297481] [2021-11-22 19:21:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:28,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:28,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:28,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193297481] [2021-11-22 19:21:28,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193297481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:28,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:28,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:21:28,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791152419] [2021-11-22 19:21:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:28,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:21:28,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:21:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:21:28,900 INFO L87 Difference]: Start difference. First operand 911 states and 1065 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:31,691 INFO L93 Difference]: Finished difference Result 3454 states and 3999 transitions. [2021-11-22 19:21:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-22 19:21:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-22 19:21:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:31,697 INFO L225 Difference]: With dead ends: 3454 [2021-11-22 19:21:31,697 INFO L226 Difference]: Without dead ends: 2602 [2021-11-22 19:21:31,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1074, Invalid=4476, Unknown=0, NotChecked=0, Total=5550 [2021-11-22 19:21:31,701 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 4159 mSDsluCounter, 3537 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4159 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:31,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4159 Valid, 4067 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 19:21:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2021-11-22 19:21:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 696. [2021-11-22 19:21:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 679 states have (on average 1.1693667157584684) internal successors, (794), 695 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 794 transitions. [2021-11-22 19:21:31,739 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 794 transitions. Word has length 85 [2021-11-22 19:21:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:31,739 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 794 transitions. [2021-11-22 19:21:31,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 794 transitions. [2021-11-22 19:21:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:21:31,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:31,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:31,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:21:31,741 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1988512152, now seen corresponding path program 1 times [2021-11-22 19:21:31,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964288099] [2021-11-22 19:21:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:31,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:32,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:32,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964288099] [2021-11-22 19:21:32,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964288099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:32,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:32,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:21:32,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606184634] [2021-11-22 19:21:32,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:32,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:21:32,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:21:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:21:32,163 INFO L87 Difference]: Start difference. First operand 696 states and 794 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:34,064 INFO L93 Difference]: Finished difference Result 2055 states and 2321 transitions. [2021-11-22 19:21:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-22 19:21:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-22 19:21:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:34,074 INFO L225 Difference]: With dead ends: 2055 [2021-11-22 19:21:34,075 INFO L226 Difference]: Without dead ends: 1816 [2021-11-22 19:21:34,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=622, Invalid=1730, Unknown=0, NotChecked=0, Total=2352 [2021-11-22 19:21:34,076 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 5697 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5697 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:34,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5697 Valid, 3261 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:21:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2021-11-22 19:21:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 701. [2021-11-22 19:21:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 684 states have (on average 1.1681286549707601) internal successors, (799), 700 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 799 transitions. [2021-11-22 19:21:34,113 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 799 transitions. Word has length 85 [2021-11-22 19:21:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:34,113 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 799 transitions. [2021-11-22 19:21:34,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 799 transitions. [2021-11-22 19:21:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:21:34,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:34,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:34,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:21:34,115 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash 297336532, now seen corresponding path program 1 times [2021-11-22 19:21:34,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:34,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052557614] [2021-11-22 19:21:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:34,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:34,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:34,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052557614] [2021-11-22 19:21:34,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052557614] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:34,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:34,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:21:34,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363432917] [2021-11-22 19:21:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:34,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:21:34,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:34,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:21:34,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:21:34,566 INFO L87 Difference]: Start difference. First operand 701 states and 799 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:37,436 INFO L93 Difference]: Finished difference Result 2999 states and 3415 transitions. [2021-11-22 19:21:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-22 19:21:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-22 19:21:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:37,443 INFO L225 Difference]: With dead ends: 2999 [2021-11-22 19:21:37,443 INFO L226 Difference]: Without dead ends: 2709 [2021-11-22 19:21:37,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1040, Invalid=3652, Unknown=0, NotChecked=0, Total=4692 [2021-11-22 19:21:37,445 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 3002 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:37,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3002 Valid, 4214 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-22 19:21:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2021-11-22 19:21:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 767. [2021-11-22 19:21:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 750 states have (on average 1.156) internal successors, (867), 766 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 867 transitions. [2021-11-22 19:21:37,486 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 867 transitions. Word has length 85 [2021-11-22 19:21:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:37,487 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 867 transitions. [2021-11-22 19:21:37,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 867 transitions. [2021-11-22 19:21:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 19:21:37,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:37,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:37,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:21:37,489 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:37,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1074470766, now seen corresponding path program 1 times [2021-11-22 19:21:37,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:37,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511066574] [2021-11-22 19:21:37,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:37,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:37,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511066574] [2021-11-22 19:21:37,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511066574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:37,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:37,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:21:37,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781548967] [2021-11-22 19:21:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:37,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:21:37,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:21:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:21:37,965 INFO L87 Difference]: Start difference. First operand 767 states and 867 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:40,940 INFO L93 Difference]: Finished difference Result 2619 states and 2922 transitions. [2021-11-22 19:21:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-11-22 19:21:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2021-11-22 19:21:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:40,946 INFO L225 Difference]: With dead ends: 2619 [2021-11-22 19:21:40,946 INFO L226 Difference]: Without dead ends: 2357 [2021-11-22 19:21:40,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1666, Invalid=5990, Unknown=0, NotChecked=0, Total=7656 [2021-11-22 19:21:40,950 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 3770 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3770 SdHoareTripleChecker+Valid, 4451 SdHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:40,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3770 Valid, 4451 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-22 19:21:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2021-11-22 19:21:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 910. [2021-11-22 19:21:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 893 states have (on average 1.1578947368421053) internal successors, (1034), 909 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1034 transitions. [2021-11-22 19:21:40,997 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1034 transitions. Word has length 85 [2021-11-22 19:21:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:40,997 INFO L470 AbstractCegarLoop]: Abstraction has 910 states and 1034 transitions. [2021-11-22 19:21:40,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1034 transitions. [2021-11-22 19:21:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-22 19:21:40,999 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:40,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:40,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:21:41,000 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2101173421, now seen corresponding path program 1 times [2021-11-22 19:21:41,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:41,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261653318] [2021-11-22 19:21:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:41,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:41,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261653318] [2021-11-22 19:21:41,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261653318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:41,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:41,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:21:41,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180262489] [2021-11-22 19:21:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:41,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:21:41,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:21:41,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:21:41,787 INFO L87 Difference]: Start difference. First operand 910 states and 1034 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:42,563 INFO L93 Difference]: Finished difference Result 1633 states and 1849 transitions. [2021-11-22 19:21:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:21:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-11-22 19:21:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:42,566 INFO L225 Difference]: With dead ends: 1633 [2021-11-22 19:21:42,567 INFO L226 Difference]: Without dead ends: 1420 [2021-11-22 19:21:42,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:21:42,570 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 1715 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:42,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 2417 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:21:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-11-22 19:21:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 872. [2021-11-22 19:21:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 855 states have (on average 1.15906432748538) internal successors, (991), 871 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 991 transitions. [2021-11-22 19:21:42,612 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 991 transitions. Word has length 86 [2021-11-22 19:21:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:42,612 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 991 transitions. [2021-11-22 19:21:42,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 991 transitions. [2021-11-22 19:21:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-22 19:21:42,614 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:42,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:42,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:21:42,615 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1480067990, now seen corresponding path program 1 times [2021-11-22 19:21:42,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:42,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842645816] [2021-11-22 19:21:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:42,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:43,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:43,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842645816] [2021-11-22 19:21:43,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842645816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:43,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:43,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:21:43,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220778294] [2021-11-22 19:21:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:43,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:21:43,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:21:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:21:43,215 INFO L87 Difference]: Start difference. First operand 872 states and 991 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:45,379 INFO L93 Difference]: Finished difference Result 4361 states and 5110 transitions. [2021-11-22 19:21:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-22 19:21:45,379 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-11-22 19:21:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:45,385 INFO L225 Difference]: With dead ends: 4361 [2021-11-22 19:21:45,385 INFO L226 Difference]: Without dead ends: 4075 [2021-11-22 19:21:45,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=579, Invalid=1871, Unknown=0, NotChecked=0, Total=2450 [2021-11-22 19:21:45,387 INFO L933 BasicCegarLoop]: 684 mSDtfsCounter, 2792 mSDsluCounter, 3661 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 4345 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:45,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2792 Valid, 4345 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-22 19:21:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2021-11-22 19:21:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 875. [2021-11-22 19:21:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 858 states have (on average 1.1585081585081585) internal successors, (994), 874 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 994 transitions. [2021-11-22 19:21:45,444 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 994 transitions. Word has length 86 [2021-11-22 19:21:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:45,444 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 994 transitions. [2021-11-22 19:21:45,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 994 transitions. [2021-11-22 19:21:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:21:45,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:45,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:45,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:21:45,446 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:45,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1142088419, now seen corresponding path program 1 times [2021-11-22 19:21:45,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:45,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866821041] [2021-11-22 19:21:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:45,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:46,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866821041] [2021-11-22 19:21:46,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866821041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:46,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:46,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:21:46,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139665116] [2021-11-22 19:21:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:46,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:21:46,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:21:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:21:46,024 INFO L87 Difference]: Start difference. First operand 875 states and 994 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:54,030 INFO L93 Difference]: Finished difference Result 4490 states and 5058 transitions. [2021-11-22 19:21:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2021-11-22 19:21:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-22 19:21:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:54,035 INFO L225 Difference]: With dead ends: 4490 [2021-11-22 19:21:54,035 INFO L226 Difference]: Without dead ends: 4295 [2021-11-22 19:21:54,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13762 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4470, Invalid=26682, Unknown=0, NotChecked=0, Total=31152 [2021-11-22 19:21:54,040 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 4679 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:54,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4679 Valid, 3124 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-22 19:21:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2021-11-22 19:21:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 875. [2021-11-22 19:21:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 858 states have (on average 1.156177156177156) internal successors, (992), 874 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 992 transitions. [2021-11-22 19:21:54,108 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 992 transitions. Word has length 88 [2021-11-22 19:21:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:54,109 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 992 transitions. [2021-11-22 19:21:54,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 992 transitions. [2021-11-22 19:21:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:21:54,110 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:54,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:54,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:21:54,111 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1766675483, now seen corresponding path program 1 times [2021-11-22 19:21:54,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:54,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898434184] [2021-11-22 19:21:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:54,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:54,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:54,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898434184] [2021-11-22 19:21:54,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898434184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:54,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:54,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:21:54,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409080561] [2021-11-22 19:21:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:54,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:21:54,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:21:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:21:54,671 INFO L87 Difference]: Start difference. First operand 875 states and 992 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:21:58,026 INFO L93 Difference]: Finished difference Result 3663 states and 4182 transitions. [2021-11-22 19:21:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:21:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-22 19:21:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:21:58,031 INFO L225 Difference]: With dead ends: 3663 [2021-11-22 19:21:58,032 INFO L226 Difference]: Without dead ends: 3474 [2021-11-22 19:21:58,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 19:21:58,033 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 7461 mSDsluCounter, 5273 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7461 SdHoareTripleChecker+Valid, 5861 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:21:58,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7461 Valid, 5861 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-22 19:21:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2021-11-22 19:21:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 909. [2021-11-22 19:21:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 892 states have (on average 1.1524663677130045) internal successors, (1028), 908 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1028 transitions. [2021-11-22 19:21:58,088 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1028 transitions. Word has length 88 [2021-11-22 19:21:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:21:58,089 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1028 transitions. [2021-11-22 19:21:58,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:21:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1028 transitions. [2021-11-22 19:21:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-22 19:21:58,090 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:21:58,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:21:58,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 19:21:58,091 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:21:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:21:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 567437405, now seen corresponding path program 1 times [2021-11-22 19:21:58,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:21:58,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328957189] [2021-11-22 19:21:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:21:58,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:21:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:21:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:21:58,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:21:58,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328957189] [2021-11-22 19:21:58,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328957189] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:21:58,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:21:58,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:21:58,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136775166] [2021-11-22 19:21:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:21:58,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:21:58,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:21:58,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:21:58,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:21:58,619 INFO L87 Difference]: Start difference. First operand 909 states and 1028 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:00,635 INFO L93 Difference]: Finished difference Result 2579 states and 2937 transitions. [2021-11-22 19:22:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:22:00,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-11-22 19:22:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:00,639 INFO L225 Difference]: With dead ends: 2579 [2021-11-22 19:22:00,639 INFO L226 Difference]: Without dead ends: 2195 [2021-11-22 19:22:00,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:22:00,640 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 3474 mSDsluCounter, 3779 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3474 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:00,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3474 Valid, 4432 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 19:22:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2021-11-22 19:22:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 875. [2021-11-22 19:22:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 858 states have (on average 1.155011655011655) internal successors, (991), 874 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 991 transitions. [2021-11-22 19:22:00,690 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 991 transitions. Word has length 88 [2021-11-22 19:22:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:00,691 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 991 transitions. [2021-11-22 19:22:00,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 991 transitions. [2021-11-22 19:22:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:22:00,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:00,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:00,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 19:22:00,693 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 10141003, now seen corresponding path program 1 times [2021-11-22 19:22:00,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:00,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750447804] [2021-11-22 19:22:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:00,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:01,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:01,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750447804] [2021-11-22 19:22:01,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750447804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:01,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:01,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:22:01,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725201328] [2021-11-22 19:22:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:01,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:22:01,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:22:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:22:01,149 INFO L87 Difference]: Start difference. First operand 875 states and 991 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:04,934 INFO L93 Difference]: Finished difference Result 3305 states and 3734 transitions. [2021-11-22 19:22:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-22 19:22:04,934 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 19:22:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:04,938 INFO L225 Difference]: With dead ends: 3305 [2021-11-22 19:22:04,938 INFO L226 Difference]: Without dead ends: 3051 [2021-11-22 19:22:04,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2728 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1533, Invalid=6299, Unknown=0, NotChecked=0, Total=7832 [2021-11-22 19:22:04,940 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 3493 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3493 SdHoareTripleChecker+Valid, 5202 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:04,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3493 Valid, 5202 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-22 19:22:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2021-11-22 19:22:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 892. [2021-11-22 19:22:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 875 states have (on average 1.1542857142857144) internal successors, (1010), 891 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1010 transitions. [2021-11-22 19:22:04,996 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1010 transitions. Word has length 91 [2021-11-22 19:22:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:04,996 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1010 transitions. [2021-11-22 19:22:04,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1010 transitions. [2021-11-22 19:22:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:22:04,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:04,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:04,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 19:22:04,998 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash 268306441, now seen corresponding path program 1 times [2021-11-22 19:22:04,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:04,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240979041] [2021-11-22 19:22:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:04,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:05,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:05,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240979041] [2021-11-22 19:22:05,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240979041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:05,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:05,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:22:05,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938792941] [2021-11-22 19:22:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:05,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:22:05,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:22:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:22:05,504 INFO L87 Difference]: Start difference. First operand 892 states and 1010 transitions. Second operand has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:09,297 INFO L93 Difference]: Finished difference Result 3560 states and 4064 transitions. [2021-11-22 19:22:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-11-22 19:22:09,298 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 19:22:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:09,302 INFO L225 Difference]: With dead ends: 3560 [2021-11-22 19:22:09,302 INFO L226 Difference]: Without dead ends: 3376 [2021-11-22 19:22:09,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1480, Invalid=4840, Unknown=0, NotChecked=0, Total=6320 [2021-11-22 19:22:09,304 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 5335 mSDsluCounter, 4889 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5335 SdHoareTripleChecker+Valid, 5532 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:09,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5335 Valid, 5532 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-22 19:22:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2021-11-22 19:22:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 1283. [2021-11-22 19:22:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1266 states have (on average 1.1729857819905214) internal successors, (1485), 1282 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1485 transitions. [2021-11-22 19:22:09,390 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1485 transitions. Word has length 91 [2021-11-22 19:22:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:09,391 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1485 transitions. [2021-11-22 19:22:09,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1485 transitions. [2021-11-22 19:22:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:22:09,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:09,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:09,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 19:22:09,393 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1422869179, now seen corresponding path program 1 times [2021-11-22 19:22:09,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:09,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603198651] [2021-11-22 19:22:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:09,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:09,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603198651] [2021-11-22 19:22:09,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603198651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:09,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:09,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:22:09,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988689367] [2021-11-22 19:22:09,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:09,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:22:09,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:22:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:22:09,900 INFO L87 Difference]: Start difference. First operand 1283 states and 1485 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:14,129 INFO L93 Difference]: Finished difference Result 3097 states and 3511 transitions. [2021-11-22 19:22:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-11-22 19:22:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 19:22:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:14,132 INFO L225 Difference]: With dead ends: 3097 [2021-11-22 19:22:14,132 INFO L226 Difference]: Without dead ends: 2896 [2021-11-22 19:22:14,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=901, Invalid=3655, Unknown=0, NotChecked=0, Total=4556 [2021-11-22 19:22:14,133 INFO L933 BasicCegarLoop]: 863 mSDtfsCounter, 1381 mSDsluCounter, 8743 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 9606 SdHoareTripleChecker+Invalid, 4310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:14,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1381 Valid, 9606 Invalid, 4310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-22 19:22:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2021-11-22 19:22:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1295. [2021-11-22 19:22:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1278 states have (on average 1.1705790297339593) internal successors, (1496), 1294 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1496 transitions. [2021-11-22 19:22:14,210 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1496 transitions. Word has length 91 [2021-11-22 19:22:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:14,211 INFO L470 AbstractCegarLoop]: Abstraction has 1295 states and 1496 transitions. [2021-11-22 19:22:14,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1496 transitions. [2021-11-22 19:22:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:22:14,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:14,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:14,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 19:22:14,212 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash 505403523, now seen corresponding path program 1 times [2021-11-22 19:22:14,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:14,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907414728] [2021-11-22 19:22:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:14,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:14,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:14,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907414728] [2021-11-22 19:22:14,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907414728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:14,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:14,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:22:14,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279531399] [2021-11-22 19:22:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:14,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:22:14,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:22:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:22:14,613 INFO L87 Difference]: Start difference. First operand 1295 states and 1496 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:15,384 INFO L93 Difference]: Finished difference Result 2833 states and 3306 transitions. [2021-11-22 19:22:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:22:15,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 19:22:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:15,387 INFO L225 Difference]: With dead ends: 2833 [2021-11-22 19:22:15,387 INFO L226 Difference]: Without dead ends: 2457 [2021-11-22 19:22:15,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:22:15,389 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 2032 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:15,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2032 Valid, 2523 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:22:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2021-11-22 19:22:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 1283. [2021-11-22 19:22:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1266 states have (on average 1.1674565560821486) internal successors, (1478), 1282 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1478 transitions. [2021-11-22 19:22:15,473 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1478 transitions. Word has length 91 [2021-11-22 19:22:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:15,473 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1478 transitions. [2021-11-22 19:22:15,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1478 transitions. [2021-11-22 19:22:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:22:15,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:15,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:15,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 19:22:15,476 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash 490355888, now seen corresponding path program 1 times [2021-11-22 19:22:15,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:15,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263718283] [2021-11-22 19:22:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:15,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:16,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263718283] [2021-11-22 19:22:16,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263718283] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:16,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:16,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:22:16,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201617380] [2021-11-22 19:22:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:16,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:22:16,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:22:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:22:16,131 INFO L87 Difference]: Start difference. First operand 1283 states and 1478 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:17,752 INFO L93 Difference]: Finished difference Result 2329 states and 2670 transitions. [2021-11-22 19:22:17,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:22:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 19:22:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:17,754 INFO L225 Difference]: With dead ends: 2329 [2021-11-22 19:22:17,754 INFO L226 Difference]: Without dead ends: 2065 [2021-11-22 19:22:17,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:22:17,755 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 2388 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 4016 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:17,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2388 Valid, 4016 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-22 19:22:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2021-11-22 19:22:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1238. [2021-11-22 19:22:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1221 states have (on average 1.1711711711711712) internal successors, (1430), 1237 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1430 transitions. [2021-11-22 19:22:17,838 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1430 transitions. Word has length 91 [2021-11-22 19:22:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:17,839 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 1430 transitions. [2021-11-22 19:22:17,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1430 transitions. [2021-11-22 19:22:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 19:22:17,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:17,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:17,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 19:22:17,841 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1470498520, now seen corresponding path program 1 times [2021-11-22 19:22:17,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:17,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411309578] [2021-11-22 19:22:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:17,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:18,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411309578] [2021-11-22 19:22:18,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411309578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:18,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:18,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:22:18,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908468757] [2021-11-22 19:22:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:18,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:22:18,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:18,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:22:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:22:18,628 INFO L87 Difference]: Start difference. First operand 1238 states and 1430 transitions. Second operand has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:20,639 INFO L93 Difference]: Finished difference Result 2655 states and 3081 transitions. [2021-11-22 19:22:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 19:22:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 19:22:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:20,641 INFO L225 Difference]: With dead ends: 2655 [2021-11-22 19:22:20,641 INFO L226 Difference]: Without dead ends: 2271 [2021-11-22 19:22:20,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1102, Unknown=0, NotChecked=0, Total=1482 [2021-11-22 19:22:20,643 INFO L933 BasicCegarLoop]: 648 mSDtfsCounter, 2134 mSDsluCounter, 3676 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2134 SdHoareTripleChecker+Valid, 4324 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:20,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2134 Valid, 4324 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-22 19:22:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2021-11-22 19:22:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1326. [2021-11-22 19:22:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1309 states have (on average 1.163483575248281) internal successors, (1523), 1325 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1523 transitions. [2021-11-22 19:22:20,727 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1523 transitions. Word has length 91 [2021-11-22 19:22:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:20,727 INFO L470 AbstractCegarLoop]: Abstraction has 1326 states and 1523 transitions. [2021-11-22 19:22:20,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1523 transitions. [2021-11-22 19:22:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:20,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:20,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:20,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 19:22:20,730 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 314403932, now seen corresponding path program 1 times [2021-11-22 19:22:20,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:20,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684797237] [2021-11-22 19:22:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:20,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:21,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:21,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684797237] [2021-11-22 19:22:21,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684797237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:21,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:21,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:22:21,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255810783] [2021-11-22 19:22:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:21,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:22:21,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:22:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:22:21,795 INFO L87 Difference]: Start difference. First operand 1326 states and 1523 transitions. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:23,516 INFO L93 Difference]: Finished difference Result 2094 states and 2398 transitions. [2021-11-22 19:22:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:22:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:23,518 INFO L225 Difference]: With dead ends: 2094 [2021-11-22 19:22:23,518 INFO L226 Difference]: Without dead ends: 1770 [2021-11-22 19:22:23,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2021-11-22 19:22:23,519 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 1939 mSDsluCounter, 3686 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 4085 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:23,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1939 Valid, 4085 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:22:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2021-11-22 19:22:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1151. [2021-11-22 19:22:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1134 states have (on average 1.1631393298059964) internal successors, (1319), 1150 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1319 transitions. [2021-11-22 19:22:23,599 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1319 transitions. Word has length 92 [2021-11-22 19:22:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:23,599 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1319 transitions. [2021-11-22 19:22:23,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1319 transitions. [2021-11-22 19:22:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:23,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:23,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:23,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-22 19:22:23,602 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1118606250, now seen corresponding path program 1 times [2021-11-22 19:22:23,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:23,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064458206] [2021-11-22 19:22:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:23,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:23,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:23,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064458206] [2021-11-22 19:22:23,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064458206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:23,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:23,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:22:23,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998583727] [2021-11-22 19:22:23,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:23,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:22:23,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:22:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:22:23,920 INFO L87 Difference]: Start difference. First operand 1151 states and 1319 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:24,847 INFO L93 Difference]: Finished difference Result 1894 states and 2181 transitions. [2021-11-22 19:22:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:22:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:24,850 INFO L225 Difference]: With dead ends: 1894 [2021-11-22 19:22:24,850 INFO L226 Difference]: Without dead ends: 1589 [2021-11-22 19:22:24,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:22:24,851 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 641 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:24,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 2428 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:22:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-11-22 19:22:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1214. [2021-11-22 19:22:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1197 states have (on average 1.155388471177945) internal successors, (1383), 1213 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1383 transitions. [2021-11-22 19:22:24,921 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1383 transitions. Word has length 92 [2021-11-22 19:22:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:24,921 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1383 transitions. [2021-11-22 19:22:24,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1383 transitions. [2021-11-22 19:22:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:24,923 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:24,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:24,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-22 19:22:24,923 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash -438547880, now seen corresponding path program 1 times [2021-11-22 19:22:24,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:24,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363208481] [2021-11-22 19:22:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:24,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:25,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:25,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363208481] [2021-11-22 19:22:25,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363208481] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:25,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:25,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:22:25,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838019940] [2021-11-22 19:22:25,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:25,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:22:25,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:22:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:22:25,107 INFO L87 Difference]: Start difference. First operand 1214 states and 1383 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:25,514 INFO L93 Difference]: Finished difference Result 1800 states and 2076 transitions. [2021-11-22 19:22:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:22:25,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:25,516 INFO L225 Difference]: With dead ends: 1800 [2021-11-22 19:22:25,516 INFO L226 Difference]: Without dead ends: 1414 [2021-11-22 19:22:25,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:22:25,517 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 225 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:25,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 981 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:22:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2021-11-22 19:22:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1206. [2021-11-22 19:22:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1189 states have (on average 1.1412952060555088) internal successors, (1357), 1205 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1357 transitions. [2021-11-22 19:22:25,617 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1357 transitions. Word has length 92 [2021-11-22 19:22:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:25,617 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 1357 transitions. [2021-11-22 19:22:25,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1357 transitions. [2021-11-22 19:22:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:25,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:25,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:25,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-22 19:22:25,620 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:25,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1471694632, now seen corresponding path program 1 times [2021-11-22 19:22:25,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:25,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354271071] [2021-11-22 19:22:25,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:25,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:25,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:25,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354271071] [2021-11-22 19:22:25,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354271071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:25,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:25,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:22:25,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255675560] [2021-11-22 19:22:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:25,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:22:25,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:22:25,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:22:25,907 INFO L87 Difference]: Start difference. First operand 1206 states and 1357 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:27,166 INFO L93 Difference]: Finished difference Result 2887 states and 3282 transitions. [2021-11-22 19:22:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 19:22:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:27,168 INFO L225 Difference]: With dead ends: 2887 [2021-11-22 19:22:27,168 INFO L226 Difference]: Without dead ends: 2577 [2021-11-22 19:22:27,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2021-11-22 19:22:27,169 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 1200 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:27,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1200 Valid, 2523 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:22:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2021-11-22 19:22:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 1158. [2021-11-22 19:22:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1141 states have (on average 1.1393514460999123) internal successors, (1300), 1157 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1300 transitions. [2021-11-22 19:22:27,241 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1300 transitions. Word has length 92 [2021-11-22 19:22:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:27,241 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 1300 transitions. [2021-11-22 19:22:27,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1300 transitions. [2021-11-22 19:22:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:27,243 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:27,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:27,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-22 19:22:27,244 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1234924762, now seen corresponding path program 1 times [2021-11-22 19:22:27,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:27,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671000887] [2021-11-22 19:22:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:27,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:27,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:27,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671000887] [2021-11-22 19:22:27,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671000887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:27,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:27,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:22:27,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068483698] [2021-11-22 19:22:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:27,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:22:27,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:22:27,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:22:27,567 INFO L87 Difference]: Start difference. First operand 1158 states and 1300 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:29,086 INFO L93 Difference]: Finished difference Result 2140 states and 2370 transitions. [2021-11-22 19:22:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-22 19:22:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:29,088 INFO L225 Difference]: With dead ends: 2140 [2021-11-22 19:22:29,088 INFO L226 Difference]: Without dead ends: 1915 [2021-11-22 19:22:29,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2021-11-22 19:22:29,089 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1635 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:29,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1635 Valid, 3895 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 19:22:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2021-11-22 19:22:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1118. [2021-11-22 19:22:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1101 states have (on average 1.1398728428701181) internal successors, (1255), 1117 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1255 transitions. [2021-11-22 19:22:29,150 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1255 transitions. Word has length 92 [2021-11-22 19:22:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:29,150 INFO L470 AbstractCegarLoop]: Abstraction has 1118 states and 1255 transitions. [2021-11-22 19:22:29,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1255 transitions. [2021-11-22 19:22:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:29,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:29,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:29,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-22 19:22:29,151 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash 267574108, now seen corresponding path program 1 times [2021-11-22 19:22:29,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:29,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643679579] [2021-11-22 19:22:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:29,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:29,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:29,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643679579] [2021-11-22 19:22:29,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643679579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:29,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:29,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:22:29,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474013176] [2021-11-22 19:22:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:29,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:22:29,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:22:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:22:29,445 INFO L87 Difference]: Start difference. First operand 1118 states and 1255 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:30,812 INFO L93 Difference]: Finished difference Result 3975 states and 4513 transitions. [2021-11-22 19:22:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 19:22:30,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:30,816 INFO L225 Difference]: With dead ends: 3975 [2021-11-22 19:22:30,816 INFO L226 Difference]: Without dead ends: 3534 [2021-11-22 19:22:30,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2021-11-22 19:22:30,817 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 2907 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:30,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2907 Valid, 2474 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:22:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2021-11-22 19:22:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 1108. [2021-11-22 19:22:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1091 states have (on average 1.1338221814848763) internal successors, (1237), 1107 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1237 transitions. [2021-11-22 19:22:30,897 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1237 transitions. Word has length 92 [2021-11-22 19:22:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:30,897 INFO L470 AbstractCegarLoop]: Abstraction has 1108 states and 1237 transitions. [2021-11-22 19:22:30,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1237 transitions. [2021-11-22 19:22:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 19:22:30,899 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:30,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:30,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-22 19:22:30,899 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 290206362, now seen corresponding path program 1 times [2021-11-22 19:22:30,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:30,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972551341] [2021-11-22 19:22:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:30,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:31,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:31,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972551341] [2021-11-22 19:22:31,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972551341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:31,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:31,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:22:31,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80693509] [2021-11-22 19:22:31,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:31,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:22:31,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:31,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:22:31,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:22:31,553 INFO L87 Difference]: Start difference. First operand 1108 states and 1237 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:35,884 INFO L93 Difference]: Finished difference Result 2709 states and 2996 transitions. [2021-11-22 19:22:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-22 19:22:35,884 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-11-22 19:22:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:35,886 INFO L225 Difference]: With dead ends: 2709 [2021-11-22 19:22:35,886 INFO L226 Difference]: Without dead ends: 2461 [2021-11-22 19:22:35,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1026, Invalid=4826, Unknown=0, NotChecked=0, Total=5852 [2021-11-22 19:22:35,888 INFO L933 BasicCegarLoop]: 783 mSDtfsCounter, 4265 mSDsluCounter, 7268 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 8051 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:35,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4265 Valid, 8051 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-22 19:22:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2021-11-22 19:22:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 966. [2021-11-22 19:22:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 949 states have (on average 1.1380400421496313) internal successors, (1080), 965 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1080 transitions. [2021-11-22 19:22:35,941 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1080 transitions. Word has length 92 [2021-11-22 19:22:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:35,942 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1080 transitions. [2021-11-22 19:22:35,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1080 transitions. [2021-11-22 19:22:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-22 19:22:35,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:35,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:35,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-22 19:22:35,944 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:35,944 INFO L85 PathProgramCache]: Analyzing trace with hash -931031665, now seen corresponding path program 1 times [2021-11-22 19:22:35,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:35,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747565456] [2021-11-22 19:22:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:35,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:36,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747565456] [2021-11-22 19:22:36,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747565456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:36,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:36,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:22:36,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347673925] [2021-11-22 19:22:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:36,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:22:36,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:22:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:22:36,292 INFO L87 Difference]: Start difference. First operand 966 states and 1080 transitions. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:37,654 INFO L93 Difference]: Finished difference Result 1524 states and 1698 transitions. [2021-11-22 19:22:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:22:37,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-22 19:22:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:37,656 INFO L225 Difference]: With dead ends: 1524 [2021-11-22 19:22:37,656 INFO L226 Difference]: Without dead ends: 1264 [2021-11-22 19:22:37,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:22:37,656 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 656 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 3035 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:37,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 3035 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:22:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2021-11-22 19:22:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 966. [2021-11-22 19:22:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 949 states have (on average 1.1338250790305584) internal successors, (1076), 965 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1076 transitions. [2021-11-22 19:22:37,706 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1076 transitions. Word has length 94 [2021-11-22 19:22:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:37,707 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1076 transitions. [2021-11-22 19:22:37,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1076 transitions. [2021-11-22 19:22:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-22 19:22:37,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:37,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:37,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-22 19:22:37,709 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -121685039, now seen corresponding path program 1 times [2021-11-22 19:22:37,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:37,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189491928] [2021-11-22 19:22:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:37,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:37,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189491928] [2021-11-22 19:22:37,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189491928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:37,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:37,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:22:37,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575966370] [2021-11-22 19:22:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:37,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:22:37,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:37,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:22:37,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:22:37,860 INFO L87 Difference]: Start difference. First operand 966 states and 1076 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:38,277 INFO L93 Difference]: Finished difference Result 1345 states and 1507 transitions. [2021-11-22 19:22:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:22:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-22 19:22:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:38,280 INFO L225 Difference]: With dead ends: 1345 [2021-11-22 19:22:38,280 INFO L226 Difference]: Without dead ends: 1337 [2021-11-22 19:22:38,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:22:38,281 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 427 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:38,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 1628 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:22:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2021-11-22 19:22:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 992. [2021-11-22 19:22:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 975 states have (on average 1.1282051282051282) internal successors, (1100), 991 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1100 transitions. [2021-11-22 19:22:38,338 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1100 transitions. Word has length 94 [2021-11-22 19:22:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:38,338 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1100 transitions. [2021-11-22 19:22:38,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1100 transitions. [2021-11-22 19:22:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:22:38,340 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:38,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:38,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-22 19:22:38,343 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 145010779, now seen corresponding path program 1 times [2021-11-22 19:22:38,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:38,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595567030] [2021-11-22 19:22:38,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:38,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:38,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:38,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595567030] [2021-11-22 19:22:38,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595567030] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:38,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:38,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:22:38,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788334012] [2021-11-22 19:22:38,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:38,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:22:38,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:22:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:22:38,916 INFO L87 Difference]: Start difference. First operand 992 states and 1100 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:39,795 INFO L93 Difference]: Finished difference Result 1575 states and 1733 transitions. [2021-11-22 19:22:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:22:39,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-11-22 19:22:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:39,796 INFO L225 Difference]: With dead ends: 1575 [2021-11-22 19:22:39,796 INFO L226 Difference]: Without dead ends: 1353 [2021-11-22 19:22:39,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:22:39,797 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 789 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:39,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 2514 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:22:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2021-11-22 19:22:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 982. [2021-11-22 19:22:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 965 states have (on average 1.1233160621761658) internal successors, (1084), 981 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1084 transitions. [2021-11-22 19:22:39,867 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1084 transitions. Word has length 97 [2021-11-22 19:22:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:39,867 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1084 transitions. [2021-11-22 19:22:39,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1084 transitions. [2021-11-22 19:22:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:22:39,869 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:39,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:39,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-22 19:22:39,869 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1273048735, now seen corresponding path program 1 times [2021-11-22 19:22:39,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:39,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715421695] [2021-11-22 19:22:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:39,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:40,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715421695] [2021-11-22 19:22:40,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715421695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:40,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:40,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-22 19:22:40,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596112483] [2021-11-22 19:22:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:40,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 19:22:40,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:40,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 19:22:40,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:22:40,516 INFO L87 Difference]: Start difference. First operand 982 states and 1084 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:42,908 INFO L93 Difference]: Finished difference Result 1748 states and 1919 transitions. [2021-11-22 19:22:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-22 19:22:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-11-22 19:22:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:42,910 INFO L225 Difference]: With dead ends: 1748 [2021-11-22 19:22:42,910 INFO L226 Difference]: Without dead ends: 1497 [2021-11-22 19:22:42,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=752, Invalid=2004, Unknown=0, NotChecked=0, Total=2756 [2021-11-22 19:22:42,911 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 3156 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3156 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:42,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3156 Valid, 3970 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:22:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-11-22 19:22:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1000. [2021-11-22 19:22:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 983 states have (on average 1.1230925737538149) internal successors, (1104), 999 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1104 transitions. [2021-11-22 19:22:42,972 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1104 transitions. Word has length 97 [2021-11-22 19:22:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:42,972 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1104 transitions. [2021-11-22 19:22:42,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1104 transitions. [2021-11-22 19:22:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:22:42,974 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:42,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:42,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-22 19:22:42,974 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:42,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2073283481, now seen corresponding path program 1 times [2021-11-22 19:22:42,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:42,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272209376] [2021-11-22 19:22:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:42,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:43,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:43,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272209376] [2021-11-22 19:22:43,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272209376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:43,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:43,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:22:43,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254876543] [2021-11-22 19:22:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:43,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:22:43,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:22:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:22:43,486 INFO L87 Difference]: Start difference. First operand 1000 states and 1104 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:44,102 INFO L93 Difference]: Finished difference Result 1631 states and 1814 transitions. [2021-11-22 19:22:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:22:44,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-11-22 19:22:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:44,104 INFO L225 Difference]: With dead ends: 1631 [2021-11-22 19:22:44,104 INFO L226 Difference]: Without dead ends: 1284 [2021-11-22 19:22:44,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:22:44,105 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 1218 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:44,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 1399 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:22:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2021-11-22 19:22:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1097. [2021-11-22 19:22:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1080 states have (on average 1.1231481481481482) internal successors, (1213), 1096 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1213 transitions. [2021-11-22 19:22:44,173 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1213 transitions. Word has length 97 [2021-11-22 19:22:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:44,173 INFO L470 AbstractCegarLoop]: Abstraction has 1097 states and 1213 transitions. [2021-11-22 19:22:44,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1213 transitions. [2021-11-22 19:22:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 19:22:44,174 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:44,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:44,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-22 19:22:44,174 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash -835480421, now seen corresponding path program 1 times [2021-11-22 19:22:44,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:44,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791284928] [2021-11-22 19:22:44,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:44,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:45,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791284928] [2021-11-22 19:22:45,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791284928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:45,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:45,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:22:45,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39681982] [2021-11-22 19:22:45,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:45,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:22:45,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:45,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:22:45,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:22:45,601 INFO L87 Difference]: Start difference. First operand 1097 states and 1213 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:48,639 INFO L93 Difference]: Finished difference Result 2072 states and 2299 transitions. [2021-11-22 19:22:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:22:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-11-22 19:22:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:48,641 INFO L225 Difference]: With dead ends: 2072 [2021-11-22 19:22:48,641 INFO L226 Difference]: Without dead ends: 1787 [2021-11-22 19:22:48,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2021-11-22 19:22:48,642 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 2450 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2450 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:48,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2450 Valid, 4095 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-22 19:22:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2021-11-22 19:22:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1065. [2021-11-22 19:22:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1048 states have (on average 1.125) internal successors, (1179), 1064 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1179 transitions. [2021-11-22 19:22:48,722 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1179 transitions. Word has length 97 [2021-11-22 19:22:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:48,722 INFO L470 AbstractCegarLoop]: Abstraction has 1065 states and 1179 transitions. [2021-11-22 19:22:48,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1179 transitions. [2021-11-22 19:22:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:22:48,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:48,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:48,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-22 19:22:48,723 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash -873432886, now seen corresponding path program 1 times [2021-11-22 19:22:48,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:48,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467965607] [2021-11-22 19:22:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:48,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:50,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:50,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467965607] [2021-11-22 19:22:50,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467965607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:50,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:50,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:22:50,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241838919] [2021-11-22 19:22:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:50,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:22:50,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:22:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:22:50,833 INFO L87 Difference]: Start difference. First operand 1065 states and 1179 transitions. Second operand has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:22:53,087 INFO L93 Difference]: Finished difference Result 1730 states and 1913 transitions. [2021-11-22 19:22:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 19:22:53,087 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2021-11-22 19:22:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:22:53,088 INFO L225 Difference]: With dead ends: 1730 [2021-11-22 19:22:53,089 INFO L226 Difference]: Without dead ends: 1494 [2021-11-22 19:22:53,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=465, Invalid=1341, Unknown=0, NotChecked=0, Total=1806 [2021-11-22 19:22:53,089 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 2738 mSDsluCounter, 4063 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2738 SdHoareTripleChecker+Valid, 4464 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:22:53,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2738 Valid, 4464 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:22:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-11-22 19:22:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1054. [2021-11-22 19:22:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1037 states have (on average 1.1272902603664416) internal successors, (1169), 1053 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1169 transitions. [2021-11-22 19:22:53,163 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1169 transitions. Word has length 98 [2021-11-22 19:22:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:22:53,163 INFO L470 AbstractCegarLoop]: Abstraction has 1054 states and 1169 transitions. [2021-11-22 19:22:53,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:22:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1169 transitions. [2021-11-22 19:22:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 19:22:53,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:22:53,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:22:53,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-22 19:22:53,164 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:22:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:22:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1730358790, now seen corresponding path program 1 times [2021-11-22 19:22:53,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:22:53,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460040576] [2021-11-22 19:22:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:22:53,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:22:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:22:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:22:55,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:22:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460040576] [2021-11-22 19:22:55,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460040576] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:22:55,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:22:55,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-11-22 19:22:55,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703358254] [2021-11-22 19:22:55,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:22:55,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-22 19:22:55,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:22:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-22 19:22:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-11-22 19:22:55,423 INFO L87 Difference]: Start difference. First operand 1054 states and 1169 transitions. Second operand has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:05,739 INFO L93 Difference]: Finished difference Result 1408 states and 1540 transitions. [2021-11-22 19:23:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-22 19:23:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2021-11-22 19:23:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:05,741 INFO L225 Difference]: With dead ends: 1408 [2021-11-22 19:23:05,741 INFO L226 Difference]: Without dead ends: 1263 [2021-11-22 19:23:05,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1099, Invalid=4157, Unknown=0, NotChecked=0, Total=5256 [2021-11-22 19:23:05,743 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 3035 mSDsluCounter, 6439 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 6914 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:05,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3035 Valid, 6914 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-11-22 19:23:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2021-11-22 19:23:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1054. [2021-11-22 19:23:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1037 states have (on average 1.1253616200578591) internal successors, (1167), 1053 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1167 transitions. [2021-11-22 19:23:05,830 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1167 transitions. Word has length 98 [2021-11-22 19:23:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:05,830 INFO L470 AbstractCegarLoop]: Abstraction has 1054 states and 1167 transitions. [2021-11-22 19:23:05,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1167 transitions. [2021-11-22 19:23:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 19:23:05,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:05,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:05,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-22 19:23:05,831 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1030204223, now seen corresponding path program 1 times [2021-11-22 19:23:05,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:05,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367028355] [2021-11-22 19:23:05,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:05,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:06,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367028355] [2021-11-22 19:23:06,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367028355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:06,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:06,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:23:06,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841987910] [2021-11-22 19:23:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:06,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:23:06,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:06,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:23:06,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:23:06,918 INFO L87 Difference]: Start difference. First operand 1054 states and 1167 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:11,486 INFO L93 Difference]: Finished difference Result 1767 states and 1939 transitions. [2021-11-22 19:23:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-11-22 19:23:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-11-22 19:23:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:11,489 INFO L225 Difference]: With dead ends: 1767 [2021-11-22 19:23:11,489 INFO L226 Difference]: Without dead ends: 1761 [2021-11-22 19:23:11,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1639, Invalid=5843, Unknown=0, NotChecked=0, Total=7482 [2021-11-22 19:23:11,491 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 3398 mSDsluCounter, 5287 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 5882 SdHoareTripleChecker+Invalid, 3099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:11,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3398 Valid, 5882 Invalid, 3099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-22 19:23:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2021-11-22 19:23:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1080. [2021-11-22 19:23:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1063 states have (on average 1.1269990592662276) internal successors, (1198), 1079 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1198 transitions. [2021-11-22 19:23:11,607 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1198 transitions. Word has length 100 [2021-11-22 19:23:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:11,607 INFO L470 AbstractCegarLoop]: Abstraction has 1080 states and 1198 transitions. [2021-11-22 19:23:11,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1198 transitions. [2021-11-22 19:23:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 19:23:11,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:11,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:11,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-22 19:23:11,608 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1574151820, now seen corresponding path program 1 times [2021-11-22 19:23:11,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998653979] [2021-11-22 19:23:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:11,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:12,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998653979] [2021-11-22 19:23:12,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998653979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:12,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:12,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:23:12,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62281997] [2021-11-22 19:23:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:12,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:23:12,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:12,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:23:12,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:23:12,029 INFO L87 Difference]: Start difference. First operand 1080 states and 1198 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:12,814 INFO L93 Difference]: Finished difference Result 1447 states and 1594 transitions. [2021-11-22 19:23:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:23:12,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2021-11-22 19:23:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:12,816 INFO L225 Difference]: With dead ends: 1447 [2021-11-22 19:23:12,816 INFO L226 Difference]: Without dead ends: 1234 [2021-11-22 19:23:12,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:23:12,816 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 1027 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:12,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1027 Valid, 1923 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:23:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2021-11-22 19:23:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1071. [2021-11-22 19:23:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1054 states have (on average 1.125237191650854) internal successors, (1186), 1070 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1186 transitions. [2021-11-22 19:23:12,911 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1186 transitions. Word has length 101 [2021-11-22 19:23:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:12,911 INFO L470 AbstractCegarLoop]: Abstraction has 1071 states and 1186 transitions. [2021-11-22 19:23:12,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1186 transitions. [2021-11-22 19:23:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-22 19:23:12,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:12,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:12,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-22 19:23:12,912 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash 938056871, now seen corresponding path program 1 times [2021-11-22 19:23:12,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:12,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040262850] [2021-11-22 19:23:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:12,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:13,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040262850] [2021-11-22 19:23:13,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040262850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:13,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:13,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:23:13,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34622793] [2021-11-22 19:23:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:13,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:23:13,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:23:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:23:13,238 INFO L87 Difference]: Start difference. First operand 1071 states and 1186 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:14,555 INFO L93 Difference]: Finished difference Result 1590 states and 1749 transitions. [2021-11-22 19:23:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 19:23:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-22 19:23:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:14,557 INFO L225 Difference]: With dead ends: 1590 [2021-11-22 19:23:14,557 INFO L226 Difference]: Without dead ends: 1383 [2021-11-22 19:23:14,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:23:14,558 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 866 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:14,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [866 Valid, 2204 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:23:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2021-11-22 19:23:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1053. [2021-11-22 19:23:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1036 states have (on average 1.1216216216216217) internal successors, (1162), 1052 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1162 transitions. [2021-11-22 19:23:14,637 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1162 transitions. Word has length 103 [2021-11-22 19:23:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:14,638 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 1162 transitions. [2021-11-22 19:23:14,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1162 transitions. [2021-11-22 19:23:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 19:23:14,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:14,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:14,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-22 19:23:14,639 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -151180706, now seen corresponding path program 1 times [2021-11-22 19:23:14,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:14,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566637833] [2021-11-22 19:23:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:14,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:14,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:14,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566637833] [2021-11-22 19:23:14,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566637833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:14,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:14,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:23:14,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537827874] [2021-11-22 19:23:14,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:14,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:23:14,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:23:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:23:14,984 INFO L87 Difference]: Start difference. First operand 1053 states and 1162 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:16,486 INFO L93 Difference]: Finished difference Result 2852 states and 3138 transitions. [2021-11-22 19:23:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-22 19:23:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-22 19:23:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:16,488 INFO L225 Difference]: With dead ends: 2852 [2021-11-22 19:23:16,488 INFO L226 Difference]: Without dead ends: 2109 [2021-11-22 19:23:16,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2021-11-22 19:23:16,490 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 3381 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3381 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:16,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3381 Valid, 3567 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 19:23:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2021-11-22 19:23:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1311. [2021-11-22 19:23:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1294 states have (on average 1.1213292117465223) internal successors, (1451), 1310 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1451 transitions. [2021-11-22 19:23:16,603 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1451 transitions. Word has length 106 [2021-11-22 19:23:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:16,603 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1451 transitions. [2021-11-22 19:23:16,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1451 transitions. [2021-11-22 19:23:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 19:23:16,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:16,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:16,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-22 19:23:16,605 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1842356326, now seen corresponding path program 1 times [2021-11-22 19:23:16,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:16,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496549553] [2021-11-22 19:23:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:16,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:16,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:16,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496549553] [2021-11-22 19:23:16,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496549553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:16,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:16,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-22 19:23:16,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150444712] [2021-11-22 19:23:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:16,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 19:23:16,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:16,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 19:23:16,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:23:16,907 INFO L87 Difference]: Start difference. First operand 1311 states and 1451 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:18,807 INFO L93 Difference]: Finished difference Result 2352 states and 2570 transitions. [2021-11-22 19:23:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-22 19:23:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-22 19:23:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:18,809 INFO L225 Difference]: With dead ends: 2352 [2021-11-22 19:23:18,809 INFO L226 Difference]: Without dead ends: 2064 [2021-11-22 19:23:18,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1739, Unknown=0, NotChecked=0, Total=2162 [2021-11-22 19:23:18,810 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 2158 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 3948 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:18,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2158 Valid, 3948 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-22 19:23:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2021-11-22 19:23:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1362. [2021-11-22 19:23:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1345 states have (on average 1.1263940520446096) internal successors, (1515), 1361 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1515 transitions. [2021-11-22 19:23:18,940 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1515 transitions. Word has length 106 [2021-11-22 19:23:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:18,940 INFO L470 AbstractCegarLoop]: Abstraction has 1362 states and 1515 transitions. [2021-11-22 19:23:18,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1515 transitions. [2021-11-22 19:23:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 19:23:18,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:18,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:18,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-22 19:23:18,943 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1725302112, now seen corresponding path program 1 times [2021-11-22 19:23:18,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:18,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253473573] [2021-11-22 19:23:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:18,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:19,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:19,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253473573] [2021-11-22 19:23:19,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253473573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:19,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:19,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-22 19:23:19,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051306454] [2021-11-22 19:23:19,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:19,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 19:23:19,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 19:23:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:23:19,565 INFO L87 Difference]: Start difference. First operand 1362 states and 1515 transitions. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:23,197 INFO L93 Difference]: Finished difference Result 2693 states and 2975 transitions. [2021-11-22 19:23:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-22 19:23:23,197 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-22 19:23:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:23,199 INFO L225 Difference]: With dead ends: 2693 [2021-11-22 19:23:23,199 INFO L226 Difference]: Without dead ends: 2497 [2021-11-22 19:23:23,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=686, Invalid=2736, Unknown=0, NotChecked=0, Total=3422 [2021-11-22 19:23:23,200 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 5177 mSDsluCounter, 7307 mSDsCounter, 0 mSdLazyCounter, 3173 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5177 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 3173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:23,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5177 Valid, 7994 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 3173 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-22 19:23:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2021-11-22 19:23:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 1586. [2021-11-22 19:23:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1569 states have (on average 1.1261950286806883) internal successors, (1767), 1585 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1767 transitions. [2021-11-22 19:23:23,333 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1767 transitions. Word has length 106 [2021-11-22 19:23:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:23,333 INFO L470 AbstractCegarLoop]: Abstraction has 1586 states and 1767 transitions. [2021-11-22 19:23:23,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1767 transitions. [2021-11-22 19:23:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 19:23:23,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:23,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:23,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-22 19:23:23,335 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 34126492, now seen corresponding path program 1 times [2021-11-22 19:23:23,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:23,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695475085] [2021-11-22 19:23:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:23,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:24,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:24,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695475085] [2021-11-22 19:23:24,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695475085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:24,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:24,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-22 19:23:24,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184188250] [2021-11-22 19:23:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:24,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-22 19:23:24,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-22 19:23:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:23:24,010 INFO L87 Difference]: Start difference. First operand 1586 states and 1767 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:26,862 INFO L93 Difference]: Finished difference Result 2689 states and 2978 transitions. [2021-11-22 19:23:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-22 19:23:26,862 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-11-22 19:23:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:26,865 INFO L225 Difference]: With dead ends: 2689 [2021-11-22 19:23:26,865 INFO L226 Difference]: Without dead ends: 2510 [2021-11-22 19:23:26,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=775, Invalid=3257, Unknown=0, NotChecked=0, Total=4032 [2021-11-22 19:23:26,866 INFO L933 BasicCegarLoop]: 551 mSDtfsCounter, 3590 mSDsluCounter, 6678 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3590 SdHoareTripleChecker+Valid, 7229 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:26,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3590 Valid, 7229 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-22 19:23:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2021-11-22 19:23:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 1873. [2021-11-22 19:23:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1856 states have (on average 1.128771551724138) internal successors, (2095), 1872 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2095 transitions. [2021-11-22 19:23:27,029 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2095 transitions. Word has length 106 [2021-11-22 19:23:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:27,029 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 2095 transitions. [2021-11-22 19:23:27,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2095 transitions. [2021-11-22 19:23:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 19:23:27,031 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:27,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:27,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-22 19:23:27,031 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -228442459, now seen corresponding path program 1 times [2021-11-22 19:23:27,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:27,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815865583] [2021-11-22 19:23:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:27,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:27,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:27,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815865583] [2021-11-22 19:23:27,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815865583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:27,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:27,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:23:27,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417670720] [2021-11-22 19:23:27,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:27,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:23:27,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:27,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:23:27,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:23:27,443 INFO L87 Difference]: Start difference. First operand 1873 states and 2095 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:28,285 INFO L93 Difference]: Finished difference Result 3855 states and 4299 transitions. [2021-11-22 19:23:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-22 19:23:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-22 19:23:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:28,287 INFO L225 Difference]: With dead ends: 3855 [2021-11-22 19:23:28,287 INFO L226 Difference]: Without dead ends: 2280 [2021-11-22 19:23:28,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:23:28,288 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 1303 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:28,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1303 Valid, 2882 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:23:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2021-11-22 19:23:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2008. [2021-11-22 19:23:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1991 states have (on average 1.1280763435459569) internal successors, (2246), 2007 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2246 transitions. [2021-11-22 19:23:28,457 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2246 transitions. Word has length 107 [2021-11-22 19:23:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:28,457 INFO L470 AbstractCegarLoop]: Abstraction has 2008 states and 2246 transitions. [2021-11-22 19:23:28,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2246 transitions. [2021-11-22 19:23:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 19:23:28,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:28,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:28,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-22 19:23:28,459 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash -396406704, now seen corresponding path program 1 times [2021-11-22 19:23:28,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:28,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393240812] [2021-11-22 19:23:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:28,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:28,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:28,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393240812] [2021-11-22 19:23:28,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393240812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:28,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:28,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:23:28,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253001376] [2021-11-22 19:23:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:28,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:23:28,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:23:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:23:28,721 INFO L87 Difference]: Start difference. First operand 2008 states and 2246 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:29,959 INFO L93 Difference]: Finished difference Result 3607 states and 4116 transitions. [2021-11-22 19:23:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:23:29,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-22 19:23:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:29,962 INFO L225 Difference]: With dead ends: 3607 [2021-11-22 19:23:29,963 INFO L226 Difference]: Without dead ends: 3207 [2021-11-22 19:23:29,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2021-11-22 19:23:29,964 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 1157 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:29,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 2227 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:23:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2021-11-22 19:23:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2205. [2021-11-22 19:23:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2188 states have (on average 1.1215722120658136) internal successors, (2454), 2204 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2454 transitions. [2021-11-22 19:23:30,144 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2454 transitions. Word has length 109 [2021-11-22 19:23:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:30,145 INFO L470 AbstractCegarLoop]: Abstraction has 2205 states and 2454 transitions. [2021-11-22 19:23:30,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 12 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2454 transitions. [2021-11-22 19:23:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 19:23:30,147 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:30,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:30,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-22 19:23:30,147 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash -749495086, now seen corresponding path program 1 times [2021-11-22 19:23:30,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:30,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568195978] [2021-11-22 19:23:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:30,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:30,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568195978] [2021-11-22 19:23:30,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568195978] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:30,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:30,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:23:30,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21086586] [2021-11-22 19:23:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:30,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:23:30,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:23:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:23:30,438 INFO L87 Difference]: Start difference. First operand 2205 states and 2454 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:31,921 INFO L93 Difference]: Finished difference Result 2701 states and 2965 transitions. [2021-11-22 19:23:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-22 19:23:31,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-22 19:23:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:31,924 INFO L225 Difference]: With dead ends: 2701 [2021-11-22 19:23:31,924 INFO L226 Difference]: Without dead ends: 2537 [2021-11-22 19:23:31,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2021-11-22 19:23:31,925 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 1886 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 3021 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:31,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1886 Valid, 3021 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 19:23:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2021-11-22 19:23:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2176. [2021-11-22 19:23:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2159 states have (on average 1.1218156553960166) internal successors, (2422), 2175 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 2422 transitions. [2021-11-22 19:23:32,122 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 2422 transitions. Word has length 109 [2021-11-22 19:23:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:32,123 INFO L470 AbstractCegarLoop]: Abstraction has 2176 states and 2422 transitions. [2021-11-22 19:23:32,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2422 transitions. [2021-11-22 19:23:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-22 19:23:32,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:32,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:32,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-22 19:23:32,125 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2080085872, now seen corresponding path program 1 times [2021-11-22 19:23:32,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:32,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281545643] [2021-11-22 19:23:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:32,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:32,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:32,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281545643] [2021-11-22 19:23:32,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281545643] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:32,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:32,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:23:32,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118328985] [2021-11-22 19:23:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:32,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:23:32,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:23:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:23:32,398 INFO L87 Difference]: Start difference. First operand 2176 states and 2422 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:32,859 INFO L93 Difference]: Finished difference Result 2333 states and 2580 transitions. [2021-11-22 19:23:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:23:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2021-11-22 19:23:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:32,862 INFO L225 Difference]: With dead ends: 2333 [2021-11-22 19:23:32,863 INFO L226 Difference]: Without dead ends: 2331 [2021-11-22 19:23:32,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:23:32,863 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 987 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:32,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [987 Valid, 1079 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:23:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2021-11-22 19:23:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2176. [2021-11-22 19:23:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2159 states have (on average 1.1213524779990736) internal successors, (2421), 2175 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 2421 transitions. [2021-11-22 19:23:33,060 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 2421 transitions. Word has length 115 [2021-11-22 19:23:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:33,060 INFO L470 AbstractCegarLoop]: Abstraction has 2176 states and 2421 transitions. [2021-11-22 19:23:33,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2421 transitions. [2021-11-22 19:23:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-22 19:23:33,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:33,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:33,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-22 19:23:33,062 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash -359114974, now seen corresponding path program 1 times [2021-11-22 19:23:33,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:33,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780535174] [2021-11-22 19:23:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:33,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:39,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:39,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780535174] [2021-11-22 19:23:39,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780535174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:39,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:39,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-11-22 19:23:39,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692053899] [2021-11-22 19:23:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:39,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-22 19:23:39,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-22 19:23:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=962, Unknown=1, NotChecked=0, Total=1056 [2021-11-22 19:23:39,693 INFO L87 Difference]: Start difference. First operand 2176 states and 2421 transitions. Second operand has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:50,828 INFO L93 Difference]: Finished difference Result 2368 states and 2622 transitions. [2021-11-22 19:23:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-22 19:23:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2021-11-22 19:23:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:50,830 INFO L225 Difference]: With dead ends: 2368 [2021-11-22 19:23:50,830 INFO L226 Difference]: Without dead ends: 2252 [2021-11-22 19:23:50,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=655, Invalid=2766, Unknown=1, NotChecked=0, Total=3422 [2021-11-22 19:23:50,831 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 2908 mSDsluCounter, 5839 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 6111 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:50,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2908 Valid, 6111 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-22 19:23:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2021-11-22 19:23:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2176. [2021-11-22 19:23:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2159 states have (on average 1.1208893006021305) internal successors, (2420), 2175 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 2420 transitions. [2021-11-22 19:23:51,013 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 2420 transitions. Word has length 115 [2021-11-22 19:23:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:51,014 INFO L470 AbstractCegarLoop]: Abstraction has 2176 states and 2420 transitions. [2021-11-22 19:23:51,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2420 transitions. [2021-11-22 19:23:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-22 19:23:51,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:51,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:51,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-22 19:23:51,015 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1092238786, now seen corresponding path program 1 times [2021-11-22 19:23:51,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:51,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232450693] [2021-11-22 19:23:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:51,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:52,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:52,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232450693] [2021-11-22 19:23:52,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232450693] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:52,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:52,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:23:52,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092786598] [2021-11-22 19:23:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:52,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:23:52,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:23:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:23:52,459 INFO L87 Difference]: Start difference. First operand 2176 states and 2420 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:23:53,656 INFO L93 Difference]: Finished difference Result 2587 states and 2873 transitions. [2021-11-22 19:23:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:23:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2021-11-22 19:23:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:23:53,658 INFO L225 Difference]: With dead ends: 2587 [2021-11-22 19:23:53,658 INFO L226 Difference]: Without dead ends: 2181 [2021-11-22 19:23:53,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=907, Unknown=0, NotChecked=0, Total=1260 [2021-11-22 19:23:53,659 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 2742 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:23:53,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2742 Valid, 2460 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-22 19:23:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2021-11-22 19:23:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1839. [2021-11-22 19:23:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1822 states have (on average 1.1180021953896817) internal successors, (2037), 1838 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2037 transitions. [2021-11-22 19:23:53,813 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2037 transitions. Word has length 115 [2021-11-22 19:23:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:23:53,813 INFO L470 AbstractCegarLoop]: Abstraction has 1839 states and 2037 transitions. [2021-11-22 19:23:53,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:23:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2037 transitions. [2021-11-22 19:23:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-22 19:23:53,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:23:53,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:23:53,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-22 19:23:53,816 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:23:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:23:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1204353829, now seen corresponding path program 1 times [2021-11-22 19:23:53,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:23:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465391747] [2021-11-22 19:23:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:23:53,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:23:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:23:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:23:55,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:23:55,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465391747] [2021-11-22 19:23:55,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465391747] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:23:55,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:23:55,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:23:55,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447808298] [2021-11-22 19:23:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:23:55,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:23:55,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:23:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:23:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:23:55,039 INFO L87 Difference]: Start difference. First operand 1839 states and 2037 transitions. Second operand has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:00,422 INFO L93 Difference]: Finished difference Result 2693 states and 2981 transitions. [2021-11-22 19:24:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-11-22 19:24:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2021-11-22 19:24:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:00,425 INFO L225 Difference]: With dead ends: 2693 [2021-11-22 19:24:00,425 INFO L226 Difference]: Without dead ends: 2689 [2021-11-22 19:24:00,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1779, Invalid=7727, Unknown=0, NotChecked=0, Total=9506 [2021-11-22 19:24:00,426 INFO L933 BasicCegarLoop]: 460 mSDtfsCounter, 4465 mSDsluCounter, 4867 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4465 SdHoareTripleChecker+Valid, 5327 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:00,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4465 Valid, 5327 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-22 19:24:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2021-11-22 19:24:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 1847. [2021-11-22 19:24:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1830 states have (on average 1.118032786885246) internal successors, (2046), 1846 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2046 transitions. [2021-11-22 19:24:00,599 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2046 transitions. Word has length 117 [2021-11-22 19:24:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:00,599 INFO L470 AbstractCegarLoop]: Abstraction has 1847 states and 2046 transitions. [2021-11-22 19:24:00,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2046 transitions. [2021-11-22 19:24:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-22 19:24:00,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:00,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:00,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-22 19:24:00,601 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1914252284, now seen corresponding path program 1 times [2021-11-22 19:24:00,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:00,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826491827] [2021-11-22 19:24:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:00,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:00,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:00,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826491827] [2021-11-22 19:24:00,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826491827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:00,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:00,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:24:00,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785703968] [2021-11-22 19:24:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:00,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:24:00,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:24:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:24:00,969 INFO L87 Difference]: Start difference. First operand 1847 states and 2046 transitions. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:02,525 INFO L93 Difference]: Finished difference Result 3701 states and 4085 transitions. [2021-11-22 19:24:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-22 19:24:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2021-11-22 19:24:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:02,528 INFO L225 Difference]: With dead ends: 3701 [2021-11-22 19:24:02,528 INFO L226 Difference]: Without dead ends: 3070 [2021-11-22 19:24:02,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2021-11-22 19:24:02,529 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 955 mSDsluCounter, 3113 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 3736 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:02,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 3736 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 19:24:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2021-11-22 19:24:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 1973. [2021-11-22 19:24:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1956 states have (on average 1.1134969325153374) internal successors, (2178), 1972 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 2178 transitions. [2021-11-22 19:24:02,709 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 2178 transitions. Word has length 118 [2021-11-22 19:24:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:02,709 INFO L470 AbstractCegarLoop]: Abstraction has 1973 states and 2178 transitions. [2021-11-22 19:24:02,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2178 transitions. [2021-11-22 19:24:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-22 19:24:02,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:02,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:02,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-22 19:24:02,711 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash -960312126, now seen corresponding path program 1 times [2021-11-22 19:24:02,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191063804] [2021-11-22 19:24:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:02,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:03,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191063804] [2021-11-22 19:24:03,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191063804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:03,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:03,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:24:03,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084665329] [2021-11-22 19:24:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:03,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:24:03,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:24:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:24:03,257 INFO L87 Difference]: Start difference. First operand 1973 states and 2178 transitions. Second operand has 19 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 19 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:06,782 INFO L93 Difference]: Finished difference Result 4825 states and 5400 transitions. [2021-11-22 19:24:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-22 19:24:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 19 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2021-11-22 19:24:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:06,787 INFO L225 Difference]: With dead ends: 4825 [2021-11-22 19:24:06,787 INFO L226 Difference]: Without dead ends: 4495 [2021-11-22 19:24:06,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=865, Invalid=2795, Unknown=0, NotChecked=0, Total=3660 [2021-11-22 19:24:06,788 INFO L933 BasicCegarLoop]: 753 mSDtfsCounter, 3347 mSDsluCounter, 4667 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3347 SdHoareTripleChecker+Valid, 5420 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:06,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3347 Valid, 5420 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-22 19:24:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2021-11-22 19:24:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 1907. [2021-11-22 19:24:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1890 states have (on average 1.1142857142857143) internal successors, (2106), 1906 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2106 transitions. [2021-11-22 19:24:06,968 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2106 transitions. Word has length 118 [2021-11-22 19:24:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:06,969 INFO L470 AbstractCegarLoop]: Abstraction has 1907 states and 2106 transitions. [2021-11-22 19:24:06,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 19 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2106 transitions. [2021-11-22 19:24:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-22 19:24:06,970 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:06,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:06,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-22 19:24:06,971 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:06,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1615091524, now seen corresponding path program 1 times [2021-11-22 19:24:06,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918406650] [2021-11-22 19:24:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:06,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:07,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:07,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918406650] [2021-11-22 19:24:07,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918406650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:07,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:07,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:24:07,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335505189] [2021-11-22 19:24:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:07,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:24:07,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:24:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:24:07,189 INFO L87 Difference]: Start difference. First operand 1907 states and 2106 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:07,844 INFO L93 Difference]: Finished difference Result 2419 states and 2649 transitions. [2021-11-22 19:24:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:24:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2021-11-22 19:24:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:07,846 INFO L225 Difference]: With dead ends: 2419 [2021-11-22 19:24:07,847 INFO L226 Difference]: Without dead ends: 2149 [2021-11-22 19:24:07,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:24:07,847 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 501 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:07,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 1840 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:24:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2021-11-22 19:24:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1896. [2021-11-22 19:24:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1879 states have (on average 1.111761575306014) internal successors, (2089), 1895 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2089 transitions. [2021-11-22 19:24:08,005 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2089 transitions. Word has length 118 [2021-11-22 19:24:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:08,006 INFO L470 AbstractCegarLoop]: Abstraction has 1896 states and 2089 transitions. [2021-11-22 19:24:08,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2089 transitions. [2021-11-22 19:24:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-22 19:24:08,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:08,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:08,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-22 19:24:08,008 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash 765121925, now seen corresponding path program 1 times [2021-11-22 19:24:08,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:08,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580633535] [2021-11-22 19:24:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:08,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:08,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:08,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580633535] [2021-11-22 19:24:08,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580633535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:08,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:08,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:24:08,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417167632] [2021-11-22 19:24:08,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:08,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:24:08,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:24:08,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:24:08,932 INFO L87 Difference]: Start difference. First operand 1896 states and 2089 transitions. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:10,338 INFO L93 Difference]: Finished difference Result 2673 states and 2918 transitions. [2021-11-22 19:24:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-22 19:24:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2021-11-22 19:24:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:10,340 INFO L225 Difference]: With dead ends: 2673 [2021-11-22 19:24:10,340 INFO L226 Difference]: Without dead ends: 2061 [2021-11-22 19:24:10,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1072, Unknown=0, NotChecked=0, Total=1406 [2021-11-22 19:24:10,342 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 2893 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2893 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:10,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2893 Valid, 2687 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:24:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2021-11-22 19:24:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1581. [2021-11-22 19:24:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1564 states have (on average 1.10613810741688) internal successors, (1730), 1580 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1730 transitions. [2021-11-22 19:24:10,494 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1730 transitions. Word has length 119 [2021-11-22 19:24:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:10,494 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 1730 transitions. [2021-11-22 19:24:10,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1730 transitions. [2021-11-22 19:24:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-22 19:24:10,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:10,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:10,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-22 19:24:10,496 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1507338763, now seen corresponding path program 1 times [2021-11-22 19:24:10,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:10,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808397582] [2021-11-22 19:24:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:10,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:11,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:11,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808397582] [2021-11-22 19:24:11,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808397582] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:11,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:11,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-22 19:24:11,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251479276] [2021-11-22 19:24:11,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:11,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-22 19:24:11,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-22 19:24:11,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-11-22 19:24:11,326 INFO L87 Difference]: Start difference. First operand 1581 states and 1730 transitions. Second operand has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:13,503 INFO L93 Difference]: Finished difference Result 2189 states and 2368 transitions. [2021-11-22 19:24:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-22 19:24:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-11-22 19:24:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:13,505 INFO L225 Difference]: With dead ends: 2189 [2021-11-22 19:24:13,505 INFO L226 Difference]: Without dead ends: 1929 [2021-11-22 19:24:13,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=628, Invalid=2794, Unknown=0, NotChecked=0, Total=3422 [2021-11-22 19:24:13,507 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 3682 mSDsluCounter, 4347 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3682 SdHoareTripleChecker+Valid, 4783 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:13,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3682 Valid, 4783 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-22 19:24:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2021-11-22 19:24:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1426. [2021-11-22 19:24:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1409 states have (on average 1.1043293115684882) internal successors, (1556), 1425 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1556 transitions. [2021-11-22 19:24:13,627 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1556 transitions. Word has length 120 [2021-11-22 19:24:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:13,627 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 1556 transitions. [2021-11-22 19:24:13,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1556 transitions. [2021-11-22 19:24:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-22 19:24:13,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:13,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:13,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-22 19:24:13,628 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:13,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash 142204209, now seen corresponding path program 1 times [2021-11-22 19:24:13,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:13,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241271967] [2021-11-22 19:24:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:13,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:14,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:14,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241271967] [2021-11-22 19:24:14,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241271967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:14,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:14,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:24:14,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585097931] [2021-11-22 19:24:14,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:14,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:24:14,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:14,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:24:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:24:14,665 INFO L87 Difference]: Start difference. First operand 1426 states and 1556 transitions. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:16,197 INFO L93 Difference]: Finished difference Result 1895 states and 2064 transitions. [2021-11-22 19:24:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 19:24:16,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-22 19:24:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:16,198 INFO L225 Difference]: With dead ends: 1895 [2021-11-22 19:24:16,198 INFO L226 Difference]: Without dead ends: 1549 [2021-11-22 19:24:16,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=445, Invalid=1447, Unknown=0, NotChecked=0, Total=1892 [2021-11-22 19:24:16,199 INFO L933 BasicCegarLoop]: 542 mSDtfsCounter, 2733 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:16,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2733 Valid, 3429 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:24:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2021-11-22 19:24:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1361. [2021-11-22 19:24:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1344 states have (on average 1.1004464285714286) internal successors, (1479), 1360 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1479 transitions. [2021-11-22 19:24:16,310 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1479 transitions. Word has length 121 [2021-11-22 19:24:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:16,310 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 1479 transitions. [2021-11-22 19:24:16,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1479 transitions. [2021-11-22 19:24:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-22 19:24:16,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:16,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:16,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-11-22 19:24:16,312 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 637466729, now seen corresponding path program 1 times [2021-11-22 19:24:16,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:16,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270177943] [2021-11-22 19:24:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:16,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:16,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:16,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270177943] [2021-11-22 19:24:16,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270177943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:16,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:16,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:24:16,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457306897] [2021-11-22 19:24:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:16,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:24:16,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:24:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:24:16,940 INFO L87 Difference]: Start difference. First operand 1361 states and 1479 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:19,547 INFO L93 Difference]: Finished difference Result 2353 states and 2531 transitions. [2021-11-22 19:24:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-22 19:24:19,547 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-22 19:24:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:19,549 INFO L225 Difference]: With dead ends: 2353 [2021-11-22 19:24:19,549 INFO L226 Difference]: Without dead ends: 2146 [2021-11-22 19:24:19,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2021-11-22 19:24:19,550 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 2929 mSDsluCounter, 3739 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2929 SdHoareTripleChecker+Valid, 4108 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:19,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2929 Valid, 4108 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-22 19:24:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-11-22 19:24:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 1470. [2021-11-22 19:24:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1453 states have (on average 1.1025464556090847) internal successors, (1602), 1469 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1602 transitions. [2021-11-22 19:24:19,679 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1602 transitions. Word has length 121 [2021-11-22 19:24:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:19,679 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 1602 transitions. [2021-11-22 19:24:19,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1602 transitions. [2021-11-22 19:24:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-22 19:24:19,680 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:19,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:19,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-11-22 19:24:19,680 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 287364256, now seen corresponding path program 1 times [2021-11-22 19:24:19,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:19,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981522512] [2021-11-22 19:24:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:19,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:20,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:20,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981522512] [2021-11-22 19:24:20,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981522512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:20,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:20,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:24:20,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601590140] [2021-11-22 19:24:20,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:20,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:24:20,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:20,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:24:20,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:24:20,197 INFO L87 Difference]: Start difference. First operand 1470 states and 1602 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:20,843 INFO L93 Difference]: Finished difference Result 2079 states and 2283 transitions. [2021-11-22 19:24:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:24:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-22 19:24:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:20,846 INFO L225 Difference]: With dead ends: 2079 [2021-11-22 19:24:20,846 INFO L226 Difference]: Without dead ends: 2077 [2021-11-22 19:24:20,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:24:20,847 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 524 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:20,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 1302 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:24:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2021-11-22 19:24:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1805. [2021-11-22 19:24:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1788 states have (on average 1.1023489932885906) internal successors, (1971), 1804 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 1971 transitions. [2021-11-22 19:24:21,024 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 1971 transitions. Word has length 121 [2021-11-22 19:24:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:21,025 INFO L470 AbstractCegarLoop]: Abstraction has 1805 states and 1971 transitions. [2021-11-22 19:24:21,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 1971 transitions. [2021-11-22 19:24:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-22 19:24:21,026 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:21,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:21,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-11-22 19:24:21,026 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash 432237039, now seen corresponding path program 1 times [2021-11-22 19:24:21,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:21,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361660010] [2021-11-22 19:24:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:21,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:22,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:22,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361660010] [2021-11-22 19:24:22,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361660010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:22,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:22,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:24:22,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096233167] [2021-11-22 19:24:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:22,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:24:22,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:24:22,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:24:22,273 INFO L87 Difference]: Start difference. First operand 1805 states and 1971 transitions. Second operand has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:25,292 INFO L93 Difference]: Finished difference Result 2926 states and 3192 transitions. [2021-11-22 19:24:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 19:24:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-22 19:24:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:25,295 INFO L225 Difference]: With dead ends: 2926 [2021-11-22 19:24:25,295 INFO L226 Difference]: Without dead ends: 2673 [2021-11-22 19:24:25,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=506, Invalid=1656, Unknown=0, NotChecked=0, Total=2162 [2021-11-22 19:24:25,296 INFO L933 BasicCegarLoop]: 898 mSDtfsCounter, 2189 mSDsluCounter, 7411 mSDsCounter, 0 mSdLazyCounter, 3134 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 8309 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:25,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2189 Valid, 8309 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3134 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-22 19:24:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2021-11-22 19:24:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 1869. [2021-11-22 19:24:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1852 states have (on average 1.0988120950323974) internal successors, (2035), 1868 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2035 transitions. [2021-11-22 19:24:25,467 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2035 transitions. Word has length 121 [2021-11-22 19:24:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:25,468 INFO L470 AbstractCegarLoop]: Abstraction has 1869 states and 2035 transitions. [2021-11-22 19:24:25,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2035 transitions. [2021-11-22 19:24:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-22 19:24:25,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:25,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:25,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-11-22 19:24:25,469 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1760003801, now seen corresponding path program 1 times [2021-11-22 19:24:25,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:25,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567186495] [2021-11-22 19:24:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:25,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:26,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567186495] [2021-11-22 19:24:26,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567186495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:26,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:26,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:24:26,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978734265] [2021-11-22 19:24:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:26,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:24:26,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:24:26,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:24:26,366 INFO L87 Difference]: Start difference. First operand 1869 states and 2035 transitions. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:28,832 INFO L93 Difference]: Finished difference Result 2618 states and 2845 transitions. [2021-11-22 19:24:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:24:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-11-22 19:24:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:28,834 INFO L225 Difference]: With dead ends: 2618 [2021-11-22 19:24:28,834 INFO L226 Difference]: Without dead ends: 1892 [2021-11-22 19:24:28,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2021-11-22 19:24:28,835 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 1586 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:28,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1586 Valid, 3345 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-22 19:24:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2021-11-22 19:24:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1637. [2021-11-22 19:24:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1620 states have (on average 1.1006172839506172) internal successors, (1783), 1636 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 1783 transitions. [2021-11-22 19:24:28,992 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 1783 transitions. Word has length 121 [2021-11-22 19:24:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:28,993 INFO L470 AbstractCegarLoop]: Abstraction has 1637 states and 1783 transitions. [2021-11-22 19:24:28,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 1783 transitions. [2021-11-22 19:24:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-22 19:24:28,995 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:28,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:28,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-11-22 19:24:28,995 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash -924282648, now seen corresponding path program 1 times [2021-11-22 19:24:28,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:28,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774739821] [2021-11-22 19:24:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:28,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:29,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:29,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774739821] [2021-11-22 19:24:29,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774739821] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:29,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:29,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-22 19:24:29,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751078841] [2021-11-22 19:24:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:29,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-22 19:24:29,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-22 19:24:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-11-22 19:24:29,855 INFO L87 Difference]: Start difference. First operand 1637 states and 1783 transitions. Second operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:35,315 INFO L93 Difference]: Finished difference Result 2775 states and 3008 transitions. [2021-11-22 19:24:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-11-22 19:24:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-11-22 19:24:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:35,317 INFO L225 Difference]: With dead ends: 2775 [2021-11-22 19:24:35,317 INFO L226 Difference]: Without dead ends: 2771 [2021-11-22 19:24:35,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2194, Invalid=13556, Unknown=0, NotChecked=0, Total=15750 [2021-11-22 19:24:35,319 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 4197 mSDsluCounter, 7243 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 7919 SdHoareTripleChecker+Invalid, 4134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:35,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4197 Valid, 7919 Invalid, 4134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-22 19:24:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2021-11-22 19:24:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1604. [2021-11-22 19:24:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1588 states have (on average 1.0994962216624684) internal successors, (1746), 1603 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 1746 transitions. [2021-11-22 19:24:35,469 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 1746 transitions. Word has length 123 [2021-11-22 19:24:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:35,469 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 1746 transitions. [2021-11-22 19:24:35,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1746 transitions. [2021-11-22 19:24:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-22 19:24:35,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:35,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:35,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-11-22 19:24:35,471 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash 504559306, now seen corresponding path program 1 times [2021-11-22 19:24:35,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:35,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785068001] [2021-11-22 19:24:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:35,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:35,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:35,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785068001] [2021-11-22 19:24:35,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785068001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:35,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:35,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:24:35,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261192354] [2021-11-22 19:24:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:35,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:24:35,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:24:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:24:35,707 INFO L87 Difference]: Start difference. First operand 1604 states and 1746 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:36,390 INFO L93 Difference]: Finished difference Result 1909 states and 2059 transitions. [2021-11-22 19:24:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-22 19:24:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2021-11-22 19:24:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:36,392 INFO L225 Difference]: With dead ends: 1909 [2021-11-22 19:24:36,393 INFO L226 Difference]: Without dead ends: 1812 [2021-11-22 19:24:36,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:24:36,393 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 1485 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:36,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1681 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:24:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-11-22 19:24:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1599. [2021-11-22 19:24:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1583 states have (on average 1.098547062539482) internal successors, (1739), 1598 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 1739 transitions. [2021-11-22 19:24:36,551 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 1739 transitions. Word has length 124 [2021-11-22 19:24:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:36,551 INFO L470 AbstractCegarLoop]: Abstraction has 1599 states and 1739 transitions. [2021-11-22 19:24:36,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1739 transitions. [2021-11-22 19:24:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-22 19:24:36,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:36,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:36,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-11-22 19:24:36,552 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1532179267, now seen corresponding path program 1 times [2021-11-22 19:24:36,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:36,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423618967] [2021-11-22 19:24:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:36,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:37,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:37,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423618967] [2021-11-22 19:24:37,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423618967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:37,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:37,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-22 19:24:37,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846167936] [2021-11-22 19:24:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:37,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 19:24:37,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:37,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 19:24:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:24:37,430 INFO L87 Difference]: Start difference. First operand 1599 states and 1739 transitions. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:38,336 INFO L93 Difference]: Finished difference Result 1811 states and 1957 transitions. [2021-11-22 19:24:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-22 19:24:38,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2021-11-22 19:24:38,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:38,337 INFO L225 Difference]: With dead ends: 1811 [2021-11-22 19:24:38,337 INFO L226 Difference]: Without dead ends: 1243 [2021-11-22 19:24:38,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2021-11-22 19:24:38,338 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 2387 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:38,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2387 Valid, 1739 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:24:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2021-11-22 19:24:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1148. [2021-11-22 19:24:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1132 states have (on average 1.0892226148409894) internal successors, (1233), 1147 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1233 transitions. [2021-11-22 19:24:38,449 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1233 transitions. Word has length 126 [2021-11-22 19:24:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:38,449 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 1233 transitions. [2021-11-22 19:24:38,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1233 transitions. [2021-11-22 19:24:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-22 19:24:38,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:38,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:38,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-11-22 19:24:38,451 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -792257350, now seen corresponding path program 1 times [2021-11-22 19:24:38,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:38,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001947676] [2021-11-22 19:24:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:38,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:46,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:46,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001947676] [2021-11-22 19:24:46,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001947676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:46,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:46,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-11-22 19:24:46,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220040834] [2021-11-22 19:24:46,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:46,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-22 19:24:46,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-22 19:24:46,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2021-11-22 19:24:46,056 INFO L87 Difference]: Start difference. First operand 1148 states and 1233 transitions. Second operand has 33 states, 33 states have (on average 3.9393939393939394) internal successors, (130), 33 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:57,699 INFO L93 Difference]: Finished difference Result 1629 states and 1735 transitions. [2021-11-22 19:24:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-22 19:24:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.9393939393939394) internal successors, (130), 33 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2021-11-22 19:24:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:57,701 INFO L225 Difference]: With dead ends: 1629 [2021-11-22 19:24:57,701 INFO L226 Difference]: Without dead ends: 1627 [2021-11-22 19:24:57,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1203, Invalid=3627, Unknown=0, NotChecked=0, Total=4830 [2021-11-22 19:24:57,702 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 2839 mSDsluCounter, 6976 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 7542 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:57,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2839 Valid, 7542 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-11-22 19:24:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-11-22 19:24:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1148. [2021-11-22 19:24:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1132 states have (on average 1.088339222614841) internal successors, (1232), 1147 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1232 transitions. [2021-11-22 19:24:57,829 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1232 transitions. Word has length 130 [2021-11-22 19:24:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:57,830 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 1232 transitions. [2021-11-22 19:24:57,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.9393939393939394) internal successors, (130), 33 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1232 transitions. [2021-11-22 19:24:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-22 19:24:57,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:57,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:57,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-11-22 19:24:57,831 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:57,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -374849971, now seen corresponding path program 1 times [2021-11-22 19:24:57,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:57,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556226917] [2021-11-22 19:24:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:57,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:58,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:58,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556226917] [2021-11-22 19:24:58,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556226917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:58,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:58,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:24:58,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677272333] [2021-11-22 19:24:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:58,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:24:58,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:24:58,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:24:58,405 INFO L87 Difference]: Start difference. First operand 1148 states and 1232 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:24:58,802 INFO L93 Difference]: Finished difference Result 1329 states and 1436 transitions. [2021-11-22 19:24:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:24:58,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2021-11-22 19:24:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:24:58,803 INFO L225 Difference]: With dead ends: 1329 [2021-11-22 19:24:58,803 INFO L226 Difference]: Without dead ends: 1114 [2021-11-22 19:24:58,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:24:58,804 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 716 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:24:58,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [716 Valid, 815 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:24:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-11-22 19:24:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2021-11-22 19:24:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1098 states have (on average 1.0783242258652095) internal successors, (1184), 1113 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1184 transitions. [2021-11-22 19:24:58,932 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1184 transitions. Word has length 136 [2021-11-22 19:24:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:24:58,932 INFO L470 AbstractCegarLoop]: Abstraction has 1114 states and 1184 transitions. [2021-11-22 19:24:58,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:24:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1184 transitions. [2021-11-22 19:24:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-22 19:24:58,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:24:58,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:24:58,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-11-22 19:24:58,933 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:24:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:24:58,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2134018761, now seen corresponding path program 1 times [2021-11-22 19:24:58,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:24:58,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417870072] [2021-11-22 19:24:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:24:58,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:24:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:24:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:24:59,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:24:59,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417870072] [2021-11-22 19:24:59,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417870072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:24:59,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:24:59,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:24:59,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481131525] [2021-11-22 19:24:59,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:24:59,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:24:59,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:24:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:24:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:24:59,173 INFO L87 Difference]: Start difference. First operand 1114 states and 1184 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:00,106 INFO L93 Difference]: Finished difference Result 1557 states and 1652 transitions. [2021-11-22 19:25:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 19:25:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2021-11-22 19:25:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:00,108 INFO L225 Difference]: With dead ends: 1557 [2021-11-22 19:25:00,108 INFO L226 Difference]: Without dead ends: 1427 [2021-11-22 19:25:00,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:25:00,109 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 830 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:00,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [830 Valid, 2678 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:25:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2021-11-22 19:25:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1242. [2021-11-22 19:25:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1226 states have (on average 1.0791190864600326) internal successors, (1323), 1241 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1323 transitions. [2021-11-22 19:25:00,237 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1323 transitions. Word has length 136 [2021-11-22 19:25:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:00,238 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 1323 transitions. [2021-11-22 19:25:00,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1323 transitions. [2021-11-22 19:25:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-22 19:25:00,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:00,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:00,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-11-22 19:25:00,239 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash 175443975, now seen corresponding path program 1 times [2021-11-22 19:25:00,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:00,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117175463] [2021-11-22 19:25:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:00,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:00,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:00,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117175463] [2021-11-22 19:25:00,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117175463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:00,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:00,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:25:00,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885549957] [2021-11-22 19:25:00,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:00,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:25:00,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:00,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:25:00,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:25:00,508 INFO L87 Difference]: Start difference. First operand 1242 states and 1323 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:01,699 INFO L93 Difference]: Finished difference Result 1911 states and 2027 transitions. [2021-11-22 19:25:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-22 19:25:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2021-11-22 19:25:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:01,701 INFO L225 Difference]: With dead ends: 1911 [2021-11-22 19:25:01,701 INFO L226 Difference]: Without dead ends: 1665 [2021-11-22 19:25:01,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:25:01,702 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 758 mSDsluCounter, 3037 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 3563 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:01,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 3563 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:25:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2021-11-22 19:25:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1190. [2021-11-22 19:25:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1174 states have (on average 1.0809199318568994) internal successors, (1269), 1189 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1269 transitions. [2021-11-22 19:25:01,829 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1269 transitions. Word has length 136 [2021-11-22 19:25:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:01,830 INFO L470 AbstractCegarLoop]: Abstraction has 1190 states and 1269 transitions. [2021-11-22 19:25:01,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1269 transitions. [2021-11-22 19:25:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-22 19:25:01,832 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:01,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:01,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-11-22 19:25:01,832 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1879066944, now seen corresponding path program 1 times [2021-11-22 19:25:01,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:01,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601709695] [2021-11-22 19:25:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:01,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:02,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:02,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601709695] [2021-11-22 19:25:02,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601709695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:02,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:02,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:25:02,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837000696] [2021-11-22 19:25:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:02,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:25:02,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:25:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:25:02,150 INFO L87 Difference]: Start difference. First operand 1190 states and 1269 transitions. Second operand has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:03,228 INFO L93 Difference]: Finished difference Result 1551 states and 1642 transitions. [2021-11-22 19:25:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-22 19:25:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2021-11-22 19:25:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:03,232 INFO L225 Difference]: With dead ends: 1551 [2021-11-22 19:25:03,232 INFO L226 Difference]: Without dead ends: 1373 [2021-11-22 19:25:03,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2021-11-22 19:25:03,233 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 878 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:03,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 2416 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:25:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-11-22 19:25:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1184. [2021-11-22 19:25:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1168 states have (on average 1.0787671232876712) internal successors, (1260), 1183 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1260 transitions. [2021-11-22 19:25:03,356 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1260 transitions. Word has length 138 [2021-11-22 19:25:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:03,356 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 1260 transitions. [2021-11-22 19:25:03,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1260 transitions. [2021-11-22 19:25:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-22 19:25:03,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:03,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:03,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-11-22 19:25:03,358 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash 41026587, now seen corresponding path program 1 times [2021-11-22 19:25:03,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612463986] [2021-11-22 19:25:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:03,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:05,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:05,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612463986] [2021-11-22 19:25:05,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612463986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:05,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:05,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-22 19:25:05,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299605159] [2021-11-22 19:25:05,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:05,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-22 19:25:05,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-22 19:25:05,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-11-22 19:25:05,177 INFO L87 Difference]: Start difference. First operand 1184 states and 1260 transitions. Second operand has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:08,453 INFO L93 Difference]: Finished difference Result 1430 states and 1531 transitions. [2021-11-22 19:25:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:25:08,454 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2021-11-22 19:25:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:08,455 INFO L225 Difference]: With dead ends: 1430 [2021-11-22 19:25:08,455 INFO L226 Difference]: Without dead ends: 1249 [2021-11-22 19:25:08,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2021-11-22 19:25:08,456 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 2261 mSDsluCounter, 3767 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:08,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2261 Valid, 4162 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-22 19:25:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2021-11-22 19:25:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1090. [2021-11-22 19:25:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1074 states have (on average 1.0754189944134078) internal successors, (1155), 1089 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1155 transitions. [2021-11-22 19:25:08,576 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1155 transitions. Word has length 138 [2021-11-22 19:25:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:08,576 INFO L470 AbstractCegarLoop]: Abstraction has 1090 states and 1155 transitions. [2021-11-22 19:25:08,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1155 transitions. [2021-11-22 19:25:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-22 19:25:08,577 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:08,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:08,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-11-22 19:25:08,577 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1079596948, now seen corresponding path program 1 times [2021-11-22 19:25:08,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:08,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607184816] [2021-11-22 19:25:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:08,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:09,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:09,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607184816] [2021-11-22 19:25:09,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607184816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:09,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:09,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:25:09,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663650045] [2021-11-22 19:25:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:09,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:25:09,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:25:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:25:09,420 INFO L87 Difference]: Start difference. First operand 1090 states and 1155 transitions. Second operand has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:14,031 INFO L93 Difference]: Finished difference Result 2075 states and 2192 transitions. [2021-11-22 19:25:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-11-22 19:25:14,031 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2021-11-22 19:25:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:14,033 INFO L225 Difference]: With dead ends: 2075 [2021-11-22 19:25:14,033 INFO L226 Difference]: Without dead ends: 2071 [2021-11-22 19:25:14,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2164, Invalid=7736, Unknown=0, NotChecked=0, Total=9900 [2021-11-22 19:25:14,035 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 2867 mSDsluCounter, 6519 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 7207 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:14,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2867 Valid, 7207 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-22 19:25:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2021-11-22 19:25:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1239. [2021-11-22 19:25:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1223 states have (on average 1.0752248569092395) internal successors, (1315), 1238 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1315 transitions. [2021-11-22 19:25:14,184 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1315 transitions. Word has length 140 [2021-11-22 19:25:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:14,184 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1315 transitions. [2021-11-22 19:25:14,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1315 transitions. [2021-11-22 19:25:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-22 19:25:14,185 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:14,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:14,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-11-22 19:25:14,185 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1013677134, now seen corresponding path program 1 times [2021-11-22 19:25:14,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400814482] [2021-11-22 19:25:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:14,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:14,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400814482] [2021-11-22 19:25:14,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400814482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:14,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:14,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 19:25:14,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847610311] [2021-11-22 19:25:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:14,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 19:25:14,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 19:25:14,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:25:14,763 INFO L87 Difference]: Start difference. First operand 1239 states and 1315 transitions. Second operand has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 17 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:16,377 INFO L93 Difference]: Finished difference Result 2288 states and 2431 transitions. [2021-11-22 19:25:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:25:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 17 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2021-11-22 19:25:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:16,379 INFO L225 Difference]: With dead ends: 2288 [2021-11-22 19:25:16,379 INFO L226 Difference]: Without dead ends: 1883 [2021-11-22 19:25:16,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2021-11-22 19:25:16,380 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 3215 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3215 SdHoareTripleChecker+Valid, 3446 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:16,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3215 Valid, 3446 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:25:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2021-11-22 19:25:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1293. [2021-11-22 19:25:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1277 states have (on average 1.0736100234925607) internal successors, (1371), 1292 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1371 transitions. [2021-11-22 19:25:16,529 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1371 transitions. Word has length 140 [2021-11-22 19:25:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:16,529 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1371 transitions. [2021-11-22 19:25:16,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.235294117647058) internal successors, (140), 17 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1371 transitions. [2021-11-22 19:25:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-22 19:25:16,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:16,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:16,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-11-22 19:25:16,530 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:16,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash -531954094, now seen corresponding path program 1 times [2021-11-22 19:25:16,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:16,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085815136] [2021-11-22 19:25:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:16,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:16,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:16,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085815136] [2021-11-22 19:25:16,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085815136] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:16,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:16,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:25:16,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076232909] [2021-11-22 19:25:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:16,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:25:16,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:16,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:25:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:25:16,987 INFO L87 Difference]: Start difference. First operand 1293 states and 1371 transitions. Second operand has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:18,360 INFO L93 Difference]: Finished difference Result 2040 states and 2194 transitions. [2021-11-22 19:25:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-22 19:25:18,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2021-11-22 19:25:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:18,362 INFO L225 Difference]: With dead ends: 2040 [2021-11-22 19:25:18,362 INFO L226 Difference]: Without dead ends: 1865 [2021-11-22 19:25:18,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2021-11-22 19:25:18,363 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 1508 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:18,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1508 Valid, 2004 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-22 19:25:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2021-11-22 19:25:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1402. [2021-11-22 19:25:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1386 states have (on average 1.0692640692640694) internal successors, (1482), 1401 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1482 transitions. [2021-11-22 19:25:18,521 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1482 transitions. Word has length 140 [2021-11-22 19:25:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:18,521 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 1482 transitions. [2021-11-22 19:25:18,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.76923076923077) internal successors, (140), 13 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1482 transitions. [2021-11-22 19:25:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-22 19:25:18,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:18,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:18,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-11-22 19:25:18,523 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1407207952, now seen corresponding path program 1 times [2021-11-22 19:25:18,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:18,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236234922] [2021-11-22 19:25:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:18,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:19,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:19,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236234922] [2021-11-22 19:25:19,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236234922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:19,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:19,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-22 19:25:19,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813454338] [2021-11-22 19:25:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:19,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-22 19:25:19,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-22 19:25:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-11-22 19:25:19,425 INFO L87 Difference]: Start difference. First operand 1402 states and 1482 transitions. Second operand has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:22,175 INFO L93 Difference]: Finished difference Result 2133 states and 2258 transitions. [2021-11-22 19:25:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-11-22 19:25:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2021-11-22 19:25:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:22,177 INFO L225 Difference]: With dead ends: 2133 [2021-11-22 19:25:22,177 INFO L226 Difference]: Without dead ends: 2131 [2021-11-22 19:25:22,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1462, Invalid=6020, Unknown=0, NotChecked=0, Total=7482 [2021-11-22 19:25:22,178 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 1709 mSDsluCounter, 4038 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4473 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:22,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1709 Valid, 4473 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-22 19:25:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2021-11-22 19:25:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1376. [2021-11-22 19:25:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1361 states have (on average 1.067597354886113) internal successors, (1453), 1375 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1453 transitions. [2021-11-22 19:25:22,336 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1453 transitions. Word has length 140 [2021-11-22 19:25:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:22,337 INFO L470 AbstractCegarLoop]: Abstraction has 1376 states and 1453 transitions. [2021-11-22 19:25:22,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.368421052631579) internal successors, (140), 19 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1453 transitions. [2021-11-22 19:25:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-22 19:25:22,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:22,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:22,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-11-22 19:25:22,338 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1173955289, now seen corresponding path program 1 times [2021-11-22 19:25:22,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:22,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712958780] [2021-11-22 19:25:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:22,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:22,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:22,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712958780] [2021-11-22 19:25:22,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712958780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:22,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:22,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:25:22,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089544993] [2021-11-22 19:25:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:22,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:25:22,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:25:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:25:22,446 INFO L87 Difference]: Start difference. First operand 1376 states and 1453 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:22,639 INFO L93 Difference]: Finished difference Result 1709 states and 1820 transitions. [2021-11-22 19:25:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:25:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2021-11-22 19:25:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:22,640 INFO L225 Difference]: With dead ends: 1709 [2021-11-22 19:25:22,641 INFO L226 Difference]: Without dead ends: 1519 [2021-11-22 19:25:22,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:25:22,641 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 328 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:22,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 1655 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:25:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2021-11-22 19:25:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1371. [2021-11-22 19:25:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1357 states have (on average 1.0633750921149594) internal successors, (1443), 1370 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1443 transitions. [2021-11-22 19:25:22,797 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1443 transitions. Word has length 144 [2021-11-22 19:25:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:22,797 INFO L470 AbstractCegarLoop]: Abstraction has 1371 states and 1443 transitions. [2021-11-22 19:25:22,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1443 transitions. [2021-11-22 19:25:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-22 19:25:22,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:22,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:22,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-11-22 19:25:22,799 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2076056845, now seen corresponding path program 1 times [2021-11-22 19:25:22,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:22,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946523303] [2021-11-22 19:25:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:22,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:23,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946523303] [2021-11-22 19:25:23,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946523303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:23,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:23,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:25:23,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117454924] [2021-11-22 19:25:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:23,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:25:23,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:25:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:25:23,030 INFO L87 Difference]: Start difference. First operand 1371 states and 1443 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:23,594 INFO L93 Difference]: Finished difference Result 1694 states and 1785 transitions. [2021-11-22 19:25:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:25:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2021-11-22 19:25:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:23,596 INFO L225 Difference]: With dead ends: 1694 [2021-11-22 19:25:23,596 INFO L226 Difference]: Without dead ends: 1462 [2021-11-22 19:25:23,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:25:23,596 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 547 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:23,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1100 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:25:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2021-11-22 19:25:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1340. [2021-11-22 19:25:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1326 states have (on average 1.055052790346908) internal successors, (1399), 1339 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1399 transitions. [2021-11-22 19:25:23,748 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1399 transitions. Word has length 145 [2021-11-22 19:25:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:23,748 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 1399 transitions. [2021-11-22 19:25:23,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1399 transitions. [2021-11-22 19:25:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-22 19:25:23,749 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:23,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:23,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-11-22 19:25:23,749 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -345773381, now seen corresponding path program 1 times [2021-11-22 19:25:23,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:23,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491591358] [2021-11-22 19:25:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:23,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:23,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491591358] [2021-11-22 19:25:23,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491591358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:23,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:23,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:25:23,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467083073] [2021-11-22 19:25:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:23,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:25:23,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:25:23,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:25:23,856 INFO L87 Difference]: Start difference. First operand 1340 states and 1399 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:24,047 INFO L93 Difference]: Finished difference Result 1674 states and 1757 transitions. [2021-11-22 19:25:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:25:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2021-11-22 19:25:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:24,049 INFO L225 Difference]: With dead ends: 1674 [2021-11-22 19:25:24,049 INFO L226 Difference]: Without dead ends: 1477 [2021-11-22 19:25:24,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:25:24,049 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 332 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:24,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 1370 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:25:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-11-22 19:25:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1340. [2021-11-22 19:25:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1326 states have (on average 1.0520361990950227) internal successors, (1395), 1339 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1395 transitions. [2021-11-22 19:25:24,196 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1395 transitions. Word has length 146 [2021-11-22 19:25:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:24,196 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 1395 transitions. [2021-11-22 19:25:24,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1395 transitions. [2021-11-22 19:25:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-22 19:25:24,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:24,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:24,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-11-22 19:25:24,198 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1015480632, now seen corresponding path program 1 times [2021-11-22 19:25:24,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:24,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462340585] [2021-11-22 19:25:24,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:24,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:24,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462340585] [2021-11-22 19:25:24,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462340585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:24,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:24,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-22 19:25:24,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164663079] [2021-11-22 19:25:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:24,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-22 19:25:24,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-22 19:25:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:25:24,791 INFO L87 Difference]: Start difference. First operand 1340 states and 1395 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:26,472 INFO L93 Difference]: Finished difference Result 2353 states and 2462 transitions. [2021-11-22 19:25:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-22 19:25:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2021-11-22 19:25:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:26,474 INFO L225 Difference]: With dead ends: 2353 [2021-11-22 19:25:26,474 INFO L226 Difference]: Without dead ends: 2195 [2021-11-22 19:25:26,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=458, Invalid=1182, Unknown=0, NotChecked=0, Total=1640 [2021-11-22 19:25:26,475 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 3572 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3572 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:26,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3572 Valid, 3652 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 19:25:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2021-11-22 19:25:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1369. [2021-11-22 19:25:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1355 states have (on average 1.051660516605166) internal successors, (1425), 1368 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1425 transitions. [2021-11-22 19:25:26,636 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1425 transitions. Word has length 148 [2021-11-22 19:25:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:26,636 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1425 transitions. [2021-11-22 19:25:26,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1425 transitions. [2021-11-22 19:25:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-22 19:25:26,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:26,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:26,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-11-22 19:25:26,638 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:26,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:26,639 INFO L85 PathProgramCache]: Analyzing trace with hash -890922634, now seen corresponding path program 1 times [2021-11-22 19:25:26,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:26,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065309533] [2021-11-22 19:25:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:26,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:27,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065309533] [2021-11-22 19:25:27,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065309533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:27,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:27,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-22 19:25:27,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503914893] [2021-11-22 19:25:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:27,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 19:25:27,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:27,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 19:25:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:25:27,130 INFO L87 Difference]: Start difference. First operand 1369 states and 1425 transitions. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:28,119 INFO L93 Difference]: Finished difference Result 1858 states and 1944 transitions. [2021-11-22 19:25:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-22 19:25:28,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2021-11-22 19:25:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:28,121 INFO L225 Difference]: With dead ends: 1858 [2021-11-22 19:25:28,121 INFO L226 Difference]: Without dead ends: 1688 [2021-11-22 19:25:28,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2021-11-22 19:25:28,122 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 1469 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:28,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1785 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:25:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2021-11-22 19:25:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1305. [2021-11-22 19:25:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1291 states have (on average 1.051123160340821) internal successors, (1357), 1304 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1357 transitions. [2021-11-22 19:25:28,281 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1357 transitions. Word has length 148 [2021-11-22 19:25:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:28,281 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1357 transitions. [2021-11-22 19:25:28,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1357 transitions. [2021-11-22 19:25:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-22 19:25:28,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:28,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:28,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-11-22 19:25:28,283 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2124180984, now seen corresponding path program 1 times [2021-11-22 19:25:28,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:28,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526244203] [2021-11-22 19:25:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:28,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:29,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:29,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526244203] [2021-11-22 19:25:29,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526244203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:29,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:29,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-22 19:25:29,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936244862] [2021-11-22 19:25:29,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:29,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-22 19:25:29,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-22 19:25:29,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:25:29,750 INFO L87 Difference]: Start difference. First operand 1305 states and 1357 transitions. Second operand has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:34,145 INFO L93 Difference]: Finished difference Result 1614 states and 1678 transitions. [2021-11-22 19:25:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-22 19:25:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2021-11-22 19:25:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:34,147 INFO L225 Difference]: With dead ends: 1614 [2021-11-22 19:25:34,147 INFO L226 Difference]: Without dead ends: 1612 [2021-11-22 19:25:34,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=732, Invalid=2130, Unknown=0, NotChecked=0, Total=2862 [2021-11-22 19:25:34,148 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 2904 mSDsluCounter, 5966 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 6567 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:34,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2904 Valid, 6567 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-22 19:25:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2021-11-22 19:25:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1303. [2021-11-22 19:25:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1290 states have (on average 1.050387596899225) internal successors, (1355), 1302 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1355 transitions. [2021-11-22 19:25:34,310 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1355 transitions. Word has length 148 [2021-11-22 19:25:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:34,311 INFO L470 AbstractCegarLoop]: Abstraction has 1303 states and 1355 transitions. [2021-11-22 19:25:34,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1355 transitions. [2021-11-22 19:25:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-22 19:25:34,312 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:34,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:34,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-11-22 19:25:34,312 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash -544264362, now seen corresponding path program 1 times [2021-11-22 19:25:34,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:34,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772183422] [2021-11-22 19:25:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:34,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:34,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:34,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772183422] [2021-11-22 19:25:34,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772183422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:34,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:34,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-22 19:25:34,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370646029] [2021-11-22 19:25:34,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:34,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:25:34,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:34,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:25:34,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:25:34,617 INFO L87 Difference]: Start difference. First operand 1303 states and 1355 transitions. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:35,855 INFO L93 Difference]: Finished difference Result 1732 states and 1802 transitions. [2021-11-22 19:25:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-22 19:25:35,856 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2021-11-22 19:25:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:35,857 INFO L225 Difference]: With dead ends: 1732 [2021-11-22 19:25:35,857 INFO L226 Difference]: Without dead ends: 1677 [2021-11-22 19:25:35,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=932, Unknown=0, NotChecked=0, Total=1260 [2021-11-22 19:25:35,858 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 1539 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:35,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1539 Valid, 2035 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-22 19:25:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2021-11-22 19:25:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1296. [2021-11-22 19:25:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1283 states have (on average 1.0498830865159783) internal successors, (1347), 1295 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1347 transitions. [2021-11-22 19:25:36,013 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1347 transitions. Word has length 149 [2021-11-22 19:25:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:36,013 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 1347 transitions. [2021-11-22 19:25:36,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1347 transitions. [2021-11-22 19:25:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-22 19:25:36,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:36,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:36,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-11-22 19:25:36,015 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1732379477, now seen corresponding path program 1 times [2021-11-22 19:25:36,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:36,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96744782] [2021-11-22 19:25:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:36,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:36,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96744782] [2021-11-22 19:25:36,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96744782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:36,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:36,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:25:36,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361898105] [2021-11-22 19:25:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:36,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:25:36,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:36,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:25:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:25:36,514 INFO L87 Difference]: Start difference. First operand 1296 states and 1347 transitions. Second operand has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:37,222 INFO L93 Difference]: Finished difference Result 1716 states and 1793 transitions. [2021-11-22 19:25:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 19:25:37,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2021-11-22 19:25:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:37,224 INFO L225 Difference]: With dead ends: 1716 [2021-11-22 19:25:37,224 INFO L226 Difference]: Without dead ends: 1421 [2021-11-22 19:25:37,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:25:37,224 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 498 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:37,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 1706 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-22 19:25:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2021-11-22 19:25:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1296. [2021-11-22 19:25:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1283 states have (on average 1.044427123928293) internal successors, (1340), 1295 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1340 transitions. [2021-11-22 19:25:37,384 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1340 transitions. Word has length 152 [2021-11-22 19:25:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:37,384 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 1340 transitions. [2021-11-22 19:25:37,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.2) internal successors, (152), 10 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1340 transitions. [2021-11-22 19:25:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-22 19:25:37,385 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:37,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:37,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-11-22 19:25:37,385 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 757149485, now seen corresponding path program 1 times [2021-11-22 19:25:37,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:37,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378083284] [2021-11-22 19:25:37,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:37,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:40,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378083284] [2021-11-22 19:25:40,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378083284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:40,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:40,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-11-22 19:25:40,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205520922] [2021-11-22 19:25:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:40,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-22 19:25:40,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-22 19:25:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2021-11-22 19:25:40,883 INFO L87 Difference]: Start difference. First operand 1296 states and 1340 transitions. Second operand has 35 states, 35 states have (on average 4.3428571428571425) internal successors, (152), 35 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:50,858 INFO L93 Difference]: Finished difference Result 1593 states and 1647 transitions. [2021-11-22 19:25:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-22 19:25:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.3428571428571425) internal successors, (152), 35 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2021-11-22 19:25:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:50,860 INFO L225 Difference]: With dead ends: 1593 [2021-11-22 19:25:50,860 INFO L226 Difference]: Without dead ends: 1538 [2021-11-22 19:25:50,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1668 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1590, Invalid=5892, Unknown=0, NotChecked=0, Total=7482 [2021-11-22 19:25:50,861 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 5134 mSDsluCounter, 6037 mSDsCounter, 0 mSdLazyCounter, 3236 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 6336 SdHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 3236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:50,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5134 Valid, 6336 Invalid, 3532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 3236 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-22 19:25:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2021-11-22 19:25:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1289. [2021-11-22 19:25:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1276 states have (on average 1.0438871473354232) internal successors, (1332), 1288 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1332 transitions. [2021-11-22 19:25:51,022 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1332 transitions. Word has length 152 [2021-11-22 19:25:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:51,022 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 1332 transitions. [2021-11-22 19:25:51,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.3428571428571425) internal successors, (152), 35 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1332 transitions. [2021-11-22 19:25:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-22 19:25:51,023 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:51,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:51,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-11-22 19:25:51,024 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash -813512343, now seen corresponding path program 1 times [2021-11-22 19:25:51,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:51,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649513303] [2021-11-22 19:25:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:51,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:51,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649513303] [2021-11-22 19:25:51,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649513303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:51,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:51,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:25:51,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097355263] [2021-11-22 19:25:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:51,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:25:51,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:25:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:25:51,182 INFO L87 Difference]: Start difference. First operand 1289 states and 1332 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:51,440 INFO L93 Difference]: Finished difference Result 1289 states and 1332 transitions. [2021-11-22 19:25:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:25:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2021-11-22 19:25:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:51,442 INFO L225 Difference]: With dead ends: 1289 [2021-11-22 19:25:51,442 INFO L226 Difference]: Without dead ends: 1287 [2021-11-22 19:25:51,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:25:51,442 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 264 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:51,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 759 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:25:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-11-22 19:25:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2021-11-22 19:25:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1275 states have (on average 1.0431372549019609) internal successors, (1330), 1286 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1330 transitions. [2021-11-22 19:25:51,622 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1330 transitions. Word has length 154 [2021-11-22 19:25:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:51,622 INFO L470 AbstractCegarLoop]: Abstraction has 1287 states and 1330 transitions. [2021-11-22 19:25:51,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1330 transitions. [2021-11-22 19:25:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-22 19:25:51,623 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:51,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:51,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-11-22 19:25:51,624 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1898696546, now seen corresponding path program 1 times [2021-11-22 19:25:51,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:51,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653410839] [2021-11-22 19:25:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:51,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:51,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:51,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653410839] [2021-11-22 19:25:51,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653410839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:51,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:51,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:25:51,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297607229] [2021-11-22 19:25:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:51,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:25:51,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:25:51,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:25:51,968 INFO L87 Difference]: Start difference. First operand 1287 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:52,944 INFO L93 Difference]: Finished difference Result 2150 states and 2236 transitions. [2021-11-22 19:25:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:25:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2021-11-22 19:25:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:52,947 INFO L225 Difference]: With dead ends: 2150 [2021-11-22 19:25:52,947 INFO L226 Difference]: Without dead ends: 2046 [2021-11-22 19:25:52,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:25:52,947 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 1460 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:52,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1460 Valid, 1991 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-22 19:25:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-11-22 19:25:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1343. [2021-11-22 19:25:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1331 states have (on average 1.0435762584522914) internal successors, (1389), 1342 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1389 transitions. [2021-11-22 19:25:53,125 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1389 transitions. Word has length 154 [2021-11-22 19:25:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:53,125 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1389 transitions. [2021-11-22 19:25:53,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1389 transitions. [2021-11-22 19:25:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-22 19:25:53,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:53,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:53,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-11-22 19:25:53,127 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -101411380, now seen corresponding path program 1 times [2021-11-22 19:25:53,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:53,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750613191] [2021-11-22 19:25:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:53,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:53,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:53,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750613191] [2021-11-22 19:25:53,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750613191] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:53,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:53,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:25:53,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257993096] [2021-11-22 19:25:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:53,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:25:53,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:25:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:25:53,322 INFO L87 Difference]: Start difference. First operand 1343 states and 1389 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:53,572 INFO L93 Difference]: Finished difference Result 1366 states and 1411 transitions. [2021-11-22 19:25:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:25:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2021-11-22 19:25:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:53,573 INFO L225 Difference]: With dead ends: 1366 [2021-11-22 19:25:53,573 INFO L226 Difference]: Without dead ends: 1343 [2021-11-22 19:25:53,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:25:53,574 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 628 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:53,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 524 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:25:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2021-11-22 19:25:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2021-11-22 19:25:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1331 states have (on average 1.04282494365139) internal successors, (1388), 1342 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1388 transitions. [2021-11-22 19:25:53,743 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1388 transitions. Word has length 156 [2021-11-22 19:25:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:53,743 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1388 transitions. [2021-11-22 19:25:53,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1388 transitions. [2021-11-22 19:25:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-22 19:25:53,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:53,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:53,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-11-22 19:25:53,744 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash -101168085, now seen corresponding path program 1 times [2021-11-22 19:25:53,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:53,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82261005] [2021-11-22 19:25:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:53,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:25:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:25:53,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:25:53,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82261005] [2021-11-22 19:25:53,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82261005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:25:53,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:25:53,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:25:53,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525211825] [2021-11-22 19:25:53,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:25:53,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:25:53,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:25:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:25:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:25:53,998 INFO L87 Difference]: Start difference. First operand 1343 states and 1388 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:25:54,449 INFO L93 Difference]: Finished difference Result 1411 states and 1457 transitions. [2021-11-22 19:25:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:25:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2021-11-22 19:25:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:25:54,451 INFO L225 Difference]: With dead ends: 1411 [2021-11-22 19:25:54,451 INFO L226 Difference]: Without dead ends: 1409 [2021-11-22 19:25:54,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:25:54,452 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 76 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:25:54,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1044 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:25:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2021-11-22 19:25:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1366. [2021-11-22 19:25:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1354 states have (on average 1.0435745937961596) internal successors, (1413), 1365 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1413 transitions. [2021-11-22 19:25:54,653 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1413 transitions. Word has length 156 [2021-11-22 19:25:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:25:54,653 INFO L470 AbstractCegarLoop]: Abstraction has 1366 states and 1413 transitions. [2021-11-22 19:25:54,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:25:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1413 transitions. [2021-11-22 19:25:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-22 19:25:54,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:25:54,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:54,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-11-22 19:25:54,654 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:25:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:25:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1268461921, now seen corresponding path program 1 times [2021-11-22 19:25:54,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:25:54,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569639752] [2021-11-22 19:25:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:25:54,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:25:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 19:25:56,138 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 19:25:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 19:25:58,055 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 19:25:58,055 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 19:25:58,055 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2021-11-22 19:25:58,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2021-11-22 19:25:58,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2021-11-22 19:25:58,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-11-22 19:25:58,061 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:25:58,063 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 19:25:58,081 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,082 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,083 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,084 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,085 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,089 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,089 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,090 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,090 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,090 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,091 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,091 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,091 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,091 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,096 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,100 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,104 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,105 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,109 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,113 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,114 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,115 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,117 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,124 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,124 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,124 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,125 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,127 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,127 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,127 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,128 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,128 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,128 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,129 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,131 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,132 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,133 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,133 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,133 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,135 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,138 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,145 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,146 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,147 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,149 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,151 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,152 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,153 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,153 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,153 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,156 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,159 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,168 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,172 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,172 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,172 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,181 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,181 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,181 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,183 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,183 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,183 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,188 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,188 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,188 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,190 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,190 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,190 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,199 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,199 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,199 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,200 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,200 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,200 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,201 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,203 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,203 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,203 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,204 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,204 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,204 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,210 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,212 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,212 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,212 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,213 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,215 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,215 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,216 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,216 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,216 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,218 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,219 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,219 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,219 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,221 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,221 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,221 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,222 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,224 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,224 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,224 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,225 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,226 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,226 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,226 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,228 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,228 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,228 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,229 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,233 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,235 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,235 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,235 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,236 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,236 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,236 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,242 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,242 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,242 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,244 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,245 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,245 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,245 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,245 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,247 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,247 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,247 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,248 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,250 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,250 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,250 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,250 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,251 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,251 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,251 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,251 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,252 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,253 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,253 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,253 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,255 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,255 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,255 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,257 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,257 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,257 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,260 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,260 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,260 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,261 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,262 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,263 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,263 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,263 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,263 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,264 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,265 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,265 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,265 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,267 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,268 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,285 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,285 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,285 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,287 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,287 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,287 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,288 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,288 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,288 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,289 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,289 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,289 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-22 19:25:58,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-22 19:25:58,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-22 19:25:58,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-22 19:25:58,297 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-22 19:25:58,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-22 19:25:58,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:25:58 BoogieIcfgContainer [2021-11-22 19:25:58,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 19:25:58,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 19:25:58,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 19:25:58,378 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 19:25:58,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:20:59" (3/4) ... [2021-11-22 19:25:58,382 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 19:25:58,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 19:25:58,382 INFO L158 Benchmark]: Toolchain (without parser) took 303162.33ms. Allocated memory was 96.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 56.6MB in the beginning and 861.2MB in the end (delta: -804.5MB). Peak memory consumption was 457.9MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1976.94ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.4MB in the beginning and 41.7MB in the end (delta: 14.8MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 193.40ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 41.7MB in the beginning and 91.6MB in the end (delta: -50.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: Boogie Preprocessor took 120.54ms. Allocated memory is still 153.1MB. Free memory was 91.6MB in the beginning and 82.4MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: RCFGBuilder took 1570.19ms. Allocated memory is still 153.1MB. Free memory was 82.4MB in the beginning and 92.2MB in the end (delta: -9.8MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: TraceAbstraction took 299291.77ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.2MB in the beginning and 862.2MB in the end (delta: -771.0MB). Peak memory consumption was 823.8MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,383 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 1.4GB. Free memory was 862.2MB in the beginning and 861.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 19:25:58,384 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1976.94ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.4MB in the beginning and 41.7MB in the end (delta: 14.8MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 193.40ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 41.7MB in the beginning and 91.6MB in the end (delta: -50.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.54ms. Allocated memory is still 153.1MB. Free memory was 91.6MB in the beginning and 82.4MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1570.19ms. Allocated memory is still 153.1MB. Free memory was 82.4MB in the beginning and 92.2MB in the end (delta: -9.8MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 299291.77ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.2MB in the beginning and 862.2MB in the end (delta: -771.0MB). Peak memory consumption was 823.8MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 1.4GB. Free memory was 862.2MB in the beginning and 861.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 8780. Possible FailurePath: [L6866-L6871] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7311] static __thread int tl_last_error = 0; [L7656-L7668] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L8779-L8927] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L8930-L8933] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L8935-L8944] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L8946-L8949] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L8951-L8955] static _Bool s_common_library_initialized = 0 ; VAL [errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L9006] CALL aws_byte_buf_eq_harness() [L8969] struct aws_byte_buf lhs; [L8970] struct aws_byte_buf rhs; [L8973] CALL, EXPR aws_byte_buf_is_bounded(&lhs, 10) [L6600] EXPR buf->capacity [L6600] return (buf->capacity <= max_size); [L8973] RET, EXPR aws_byte_buf_is_bounded(&lhs, 10) [L8973] CALL assume_abort_if_not(aws_byte_buf_is_bounded(&lhs, 10)) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L8973] RET assume_abort_if_not(aws_byte_buf_is_bounded(&lhs, 10)) [L8974] CALL ensure_byte_buf_has_allocated_buffer_member(&lhs) [L6610] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6610] RET, EXPR nondet_bool() [L6610-L6612] EXPR (nondet_bool()) ? ((void *)0) : can_fail_allocator() VAL [(nondet_bool()) ? ((void *)0) : can_fail_allocator()={0:0}, buf={268:0}, buf={268:0}, errors={197:0}, nondet_bool()=-255, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L6610-L6612] buf->allocator = (nondet_bool()) ? ((void *)0) : can_fail_allocator() [L6613] EXPR buf->capacity [L6613] CALL, EXPR bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L6883-L6885] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L6883-L6885] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L6886] return malloc(size); [L6613] RET, EXPR bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L6613] buf->buffer = bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L8974] RET ensure_byte_buf_has_allocated_buffer_member(&lhs) [L8975] CALL, EXPR aws_byte_buf_is_valid(&lhs) [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7385] EXPR buf->capacity [L7385] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7386] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7388] EXPR buf->len [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7388] EXPR buf->len [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) [L7388] EXPR buf->buffer [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L8975] RET, EXPR aws_byte_buf_is_valid(&lhs) [L8975] CALL assume_abort_if_not(aws_byte_buf_is_valid(&lhs)) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L8975] RET assume_abort_if_not(aws_byte_buf_is_valid(&lhs)) [L8976] CALL nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L8976] RET nondet_bool() [L8976] COND FALSE !(nondet_bool()) [L8979] CALL, EXPR aws_byte_buf_is_bounded(&rhs, 10) [L6600] EXPR buf->capacity [L6600] return (buf->capacity <= max_size); [L8979] RET, EXPR aws_byte_buf_is_bounded(&rhs, 10) [L8979] CALL assume_abort_if_not(aws_byte_buf_is_bounded(&rhs, 10)) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L8979] RET assume_abort_if_not(aws_byte_buf_is_bounded(&rhs, 10)) [L8980] CALL ensure_byte_buf_has_allocated_buffer_member(&rhs) [L6610] CALL, EXPR nondet_bool() [L261] return __VERIFIER_nondet_bool(); [L6610] RET, EXPR nondet_bool() [L6610-L6612] EXPR (nondet_bool()) ? ((void *)0) : can_fail_allocator() VAL [(nondet_bool()) ? ((void *)0) : can_fail_allocator()={0:0}, buf={261:0}, buf={261:0}, errors={197:0}, nondet_bool()=513, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L6610-L6612] buf->allocator = (nondet_bool()) ? ((void *)0) : can_fail_allocator() [L6613] EXPR buf->capacity [L6613] CALL, EXPR bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L6883-L6885] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L6883-L6885] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) [L6886] return malloc(size); [L6613] RET, EXPR bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L6613] buf->buffer = bounded_malloc(sizeof(*(buf->buffer)) * buf->capacity) [L8980] RET ensure_byte_buf_has_allocated_buffer_member(&rhs) [L8981] CALL, EXPR aws_byte_buf_is_valid(&rhs) [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7385] EXPR buf->capacity [L7385] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7386] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7388] EXPR buf->len [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7388] EXPR buf->len [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) [L7388] EXPR buf->buffer [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L8981] RET, EXPR aws_byte_buf_is_valid(&rhs) [L8981] CALL assume_abort_if_not(aws_byte_buf_is_valid(&rhs)) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L8981] RET assume_abort_if_not(aws_byte_buf_is_valid(&rhs)) [L8985] struct aws_byte_buf old_lhs = lhs; [L8986] struct store_byte_from_buffer old_byte_from_lhs; [L8987] EXPR lhs.buffer [L8987] EXPR lhs.len [L8987] CALL save_byte_from_array(lhs.buffer, lhs.len, &old_byte_from_lhs) [L7135] COND TRUE size > 0 && array && storage [L7136] CALL, EXPR nondet_size_t() [L263] return __VERIFIER_nondet_ulong(); [L7136] RET, EXPR nondet_size_t() [L7136] storage->index = nondet_size_t() [L7137] EXPR storage->index [L7137] CALL assume_abort_if_not(storage->index < size) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7137] RET assume_abort_if_not(storage->index < size) [L7138] EXPR storage->index [L7138] EXPR array[storage->index] [L7138] storage->byte = array[storage->index] [L8987] RET save_byte_from_array(lhs.buffer, lhs.len, &old_byte_from_lhs) [L8988] struct aws_byte_buf old_rhs = rhs; [L8989] struct store_byte_from_buffer old_byte_from_rhs; [L8990] EXPR rhs.buffer [L8990] EXPR rhs.len [L8990] CALL save_byte_from_array(rhs.buffer, rhs.len, &old_byte_from_rhs) [L7135] COND TRUE size > 0 && array && storage [L7136] CALL, EXPR nondet_size_t() [L263] return __VERIFIER_nondet_ulong(); [L7136] RET, EXPR nondet_size_t() [L7136] storage->index = nondet_size_t() [L7137] EXPR storage->index [L7137] CALL assume_abort_if_not(storage->index < size) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7137] RET assume_abort_if_not(storage->index < size) [L7138] EXPR storage->index [L7138] EXPR array[storage->index] [L7138] storage->byte = array[storage->index] [L8990] RET save_byte_from_array(rhs.buffer, rhs.len, &old_byte_from_rhs) [L8993] CALL aws_byte_buf_eq(&lhs, &rhs) [L7441] CALL, EXPR aws_byte_buf_is_valid(a) [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7385] EXPR buf->capacity [L7385] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7386] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7388] EXPR buf->len [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7388] EXPR buf->len [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) [L7388] EXPR buf->buffer [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L7441] RET, EXPR aws_byte_buf_is_valid(a) [L7441] CALL assume_abort_if_not((aws_byte_buf_is_valid(a))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7441] RET assume_abort_if_not((aws_byte_buf_is_valid(a))) [L7442] CALL, EXPR aws_byte_buf_is_valid(b) [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7385] EXPR buf->capacity [L7385] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7386] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7388] EXPR buf->len [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7388] EXPR buf->len [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) [L7388] EXPR buf->buffer [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L7442] RET, EXPR aws_byte_buf_is_valid(b) [L7442] CALL assume_abort_if_not((aws_byte_buf_is_valid(b))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7442] RET assume_abort_if_not((aws_byte_buf_is_valid(b))) [L7445] EXPR a->buffer [L7445] EXPR a->len [L7445] EXPR b->buffer [L7445] EXPR b->len [L7445] CALL, EXPR aws_array_eq(a->buffer, a->len, b->buffer, b->len) [L7710] CALL assume_abort_if_not(((len_a == 0) || ((((len_a)) == 0) || ((array_a))))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7710] RET assume_abort_if_not(((len_a == 0) || ((((len_a)) == 0) || ((array_a))))) [L7712] CALL assume_abort_if_not(((len_b == 0) || ((((len_b)) == 0) || ((array_b))))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7712] RET assume_abort_if_not(((len_b == 0) || ((((len_b)) == 0) || ((array_b))))) [L7715] COND FALSE !(len_a != len_b) VAL [\old(len_a)=2, \old(len_b)=2, array_a={-2:0}, array_a={-2:0}, array_b={257:0}, array_b={257:0}, errors={197:0}, len_a=2, len_b=2, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7721] COND FALSE !(len_a == 0) [L7727] return !memcmp(array_a, array_b, len_a); [L7445] RET, EXPR aws_array_eq(a->buffer, a->len, b->buffer, b->len) [L7444-L7445] _Bool rval = aws_array_eq(a->buffer, a->len, b->buffer, b->len); [L7446] CALL, EXPR aws_byte_buf_is_valid(a) [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7385] EXPR buf->capacity [L7385] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7386] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7388] EXPR buf->len [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7388] EXPR buf->len [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) [L7388] EXPR buf->buffer [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={268:0}, buf={268:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={-2:0}, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity=-129127208515966861310, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-36893488147419103230, buf->len=-36893488147419103230, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L7446] RET, EXPR aws_byte_buf_is_valid(a) [L7446] CALL __VERIFIER_assert((aws_byte_buf_is_valid(a))) [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7446] RET __VERIFIER_assert((aws_byte_buf_is_valid(a))) [L7447] CALL, EXPR aws_byte_buf_is_valid(b) [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) [L7385] EXPR buf->capacity [L7385] EXPR buf->capacity == 0 && buf->len == 0 VAL [buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7386] EXPR buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) VAL [buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity [L7388] EXPR buf->len [L7388] EXPR buf->capacity [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity VAL [(buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) [L7388] EXPR buf->len [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) [L7388] EXPR buf->buffer [L7388] EXPR (((buf->len)) == 0) || ((buf->buffer)) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7388] EXPR buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=0, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] EXPR buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))) VAL [(((buf->len)) == 0) || ((buf->buffer))=1, (buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))=1, buf={261:0}, buf={261:0}, buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))))=1, buf->buffer={257:0}, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity=-18446744073709551614, buf->capacity == 0 && buf->len == 0=0, buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0)=0, buf->capacity > 0 && buf->len <= buf->capacity=1, buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer)))=1, buf->len=-18446744073709551614, buf->len=-18446744073709551614, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7385-L7388] return buf && ((buf->capacity == 0 && buf->len == 0 && buf->buffer == ((void *)0) ) || (buf->capacity > 0 && buf->len <= buf->capacity && ((((buf->len)) == 0) || ((buf->buffer))))); [L7447] RET, EXPR aws_byte_buf_is_valid(b) [L7447] CALL __VERIFIER_assert((aws_byte_buf_is_valid(b))) [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L7447] RET __VERIFIER_assert((aws_byte_buf_is_valid(b))) [L7448] return rval; VAL [\result=1, a={268:0}, a={268:0}, b={261:0}, b={261:0}, errors={197:0}, rval=1, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L8993] RET aws_byte_buf_eq(&lhs, &rhs) [L8993] COND TRUE aws_byte_buf_eq(&lhs, &rhs) [L8994] EXPR lhs.len [L8994] EXPR rhs.len [L8994] CALL __VERIFIER_assert(lhs.len == rhs.len) [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L8994] RET __VERIFIER_assert(lhs.len == rhs.len) [L8995] EXPR lhs.len VAL [errors={197:0}, lhs={268:0}, lhs.len=-36893488147419103230, old_byte_from_lhs={269:0}, old_byte_from_rhs={259:0}, old_lhs={266:0}, old_rhs={265:0}, rhs={261:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] [L8995] COND TRUE lhs.len > 0 [L8996] EXPR lhs.buffer [L8996] EXPR rhs.buffer [L8996] EXPR lhs.len [L8996] CALL assert_bytes_match(lhs.buffer, rhs.buffer, lhs.len) [L7100] CALL __VERIFIER_assert(!a == !b) [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7100] RET __VERIFIER_assert(!a == !b) [L7101-L7104] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) [L7106] CALL, EXPR nondet_uint64_t() [L266] return __VERIFIER_nondet_ulong(); [L7106] RET, EXPR nondet_uint64_t() [L7106] size_t i = nondet_uint64_t(); [L7107-L7109] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L7107-L7109] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) [L7110] EXPR a[i] [L7110] EXPR b[i] [L7110] CALL __VERIFIER_assert(a[i] == b[i]) [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list=2, s_common_log_subject_list={198:0}, s_list={197:0}, s_list=46, s_tolower_table={196:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, errors={197:0}, s_can_fail_allocator_static={195:0}, s_common_library_initialized=0, s_common_log_subject_infos={198:0}, s_common_log_subject_list={198:0}, s_common_log_subject_list=2, s_list=46, s_list={197:0}, s_tolower_table={196:0}, tl_last_error=0] - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 263 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 298.9s, OverallIterations: 99, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 213.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212668 SdHoareTripleChecker+Valid, 104.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212668 mSDsluCounter, 334667 SdHoareTripleChecker+Invalid, 89.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291112 mSDsCounter, 10340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134753 IncrementalHoareTripleChecker+Invalid, 145093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10340 mSolverCounterUnsat, 43555 mSDtfsCounter, 134753 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4180 GetRequests, 452 SyntacticMatches, 43 SemanticMatches, 3685 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65757 ImplicationChecksByTransitivity, 108.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=57, InterpolantAutomatonStates: 3093, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 98 MinimizatonAttempts, 74504 StatesRemovedByMinimization, 91 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 32.5s SatisfiabilityAnalysisTime, 37.8s InterpolantComputationTime, 10591 NumberOfCodeBlocks, 10591 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 10336 ConstructedInterpolants, 0 QuantifiedInterpolants, 151287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 98 InterpolantComputations, 98 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-22 19:25:58,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash efe93c285b9cfe4b236eb7cc9957c6e5b1b94bff3322775b8e8d61a9769c319e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 19:26:00,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:26:00,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:26:00,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:26:00,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:26:00,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:26:00,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:26:00,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:26:00,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:26:00,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:26:00,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:26:00,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:26:00,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:26:00,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:26:00,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:26:00,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:26:00,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:26:00,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:26:00,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:26:00,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:26:00,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:26:00,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:26:00,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:26:00,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:26:00,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:26:00,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:26:00,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:26:00,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:26:00,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:26:00,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:26:00,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:26:00,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:26:00,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:26:00,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:26:00,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:26:00,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:26:00,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:26:00,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:26:00,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:26:00,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:26:00,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:26:00,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 19:26:00,490 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:26:00,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:26:00,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:26:00,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:26:00,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:26:00,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:26:00,494 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:26:00,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:26:00,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:26:00,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:26:00,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:26:00,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:26:00,495 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 19:26:00,495 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 19:26:00,496 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 19:26:00,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:26:00,496 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:26:00,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:26:00,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:26:00,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:26:00,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:26:00,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:26:00,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:26:00,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:26:00,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:26:00,504 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 19:26:00,504 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 19:26:00,504 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:26:00,505 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:26:00,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:26:00,505 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:26:00,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 19:26:00,505 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efe93c285b9cfe4b236eb7cc9957c6e5b1b94bff3322775b8e8d61a9769c319e [2021-11-22 19:26:00,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:26:00,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:26:00,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:26:00,821 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:26:00,822 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:26:00,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i [2021-11-22 19:26:00,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ef92724/7faf6b7382d14fd8ae2e1b1dcee2c43b/FLAG0c3915075 [2021-11-22 19:26:01,612 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:26:01,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i [2021-11-22 19:26:01,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ef92724/7faf6b7382d14fd8ae2e1b1dcee2c43b/FLAG0c3915075 [2021-11-22 19:26:01,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ef92724/7faf6b7382d14fd8ae2e1b1dcee2c43b [2021-11-22 19:26:01,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:26:01,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:26:01,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:26:01,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:26:01,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:26:01,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:26:01" (1/1) ... [2021-11-22 19:26:01,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b62becf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:01, skipping insertion in model container [2021-11-22 19:26:01,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:26:01" (1/1) ... [2021-11-22 19:26:01,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:26:01,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:26:02,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4489,4502] [2021-11-22 19:26:02,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4549,4562] [2021-11-22 19:26:02,878 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,881 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,882 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,882 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,883 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,892 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,893 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,894 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:02,894 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,180 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:26:03,182 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:26:03,183 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:26:03,183 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:26:03,184 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:26:03,185 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:26:03,185 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:26:03,186 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:26:03,186 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:26:03,187 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:26:03,311 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:26:03,410 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,419 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:26:03,545 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 19:26:03,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:26:03,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4489,4502] [2021-11-22 19:26:03,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4549,4562] [2021-11-22 19:26:03,632 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,633 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,633 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,633 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,635 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,644 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,646 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,647 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,648 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,702 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:26:03,703 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:26:03,704 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:26:03,704 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:26:03,705 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:26:03,705 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:26:03,705 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:26:03,706 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:26:03,706 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:26:03,706 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:26:03,725 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:26:03,779 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,780 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:26:03,846 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:26:03,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4489,4502] [2021-11-22 19:26:03,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_eq_harness.i[4549,4562] [2021-11-22 19:26:03,894 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,895 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,895 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,895 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,896 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,899 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,900 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,900 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,900 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:03,933 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:26:03,934 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:26:03,934 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:26:03,935 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:26:03,935 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:26:03,936 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:26:03,936 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:26:03,936 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:26:03,937 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:26:03,937 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:26:03,954 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:26:04,029 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:04,030 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:26:04,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:26:04,328 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:26:04,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04 WrapperNode [2021-11-22 19:26:04,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:26:04,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:26:04,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:26:04,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:26:04,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,542 INFO L137 Inliner]: procedures = 711, calls = 2666, calls flagged for inlining = 963, calls inlined = 64, statements flattened = 1551 [2021-11-22 19:26:04,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:26:04,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:26:04,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:26:04,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:26:04,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:26:04,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:26:04,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:26:04,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:26:04,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (1/1) ... [2021-11-22 19:26:04,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:26:04,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:26:04,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 19:26:04,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 19:26:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-22 19:26:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:26:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:26:04,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:26:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 19:26:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 19:26:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:26:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:26:04,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 19:26:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-22 19:26:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:26:05,048 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:26:05,050 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:26:08,574 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:26:08,582 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:26:08,582 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 19:26:08,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:26:08 BoogieIcfgContainer [2021-11-22 19:26:08,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:26:08,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:26:08,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:26:08,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:26:08,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:26:01" (1/3) ... [2021-11-22 19:26:08,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63715aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:26:08, skipping insertion in model container [2021-11-22 19:26:08,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:26:04" (2/3) ... [2021-11-22 19:26:08,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63715aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:26:08, skipping insertion in model container [2021-11-22 19:26:08,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:26:08" (3/3) ... [2021-11-22 19:26:08,597 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_harness.i [2021-11-22 19:26:08,602 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:26:08,603 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-11-22 19:26:08,662 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:26:08,669 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 19:26:08,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-11-22 19:26:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 262 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:08,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 19:26:08,695 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:08,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:08,696 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 853988342, now seen corresponding path program 1 times [2021-11-22 19:26:08,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:08,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063335148] [2021-11-22 19:26:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:08,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:08,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:08,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 19:26:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:09,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-22 19:26:09,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:09,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:26:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:09,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 19:26:09,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063335148] [2021-11-22 19:26:09,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063335148] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 19:26:09,852 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:26:09,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 19:26:09,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366535891] [2021-11-22 19:26:09,856 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 19:26:09,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:26:09,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 19:26:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:26:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:26:09,891 INFO L87 Difference]: Start difference. First operand has 263 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 262 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:26:09,923 INFO L93 Difference]: Finished difference Result 522 states and 723 transitions. [2021-11-22 19:26:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:26:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-11-22 19:26:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:26:09,935 INFO L225 Difference]: With dead ends: 522 [2021-11-22 19:26:09,935 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 19:26:09,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:26:09,941 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:26:09,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:26:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 19:26:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-22 19:26:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 255 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 324 transitions. [2021-11-22 19:26:09,987 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 324 transitions. Word has length 45 [2021-11-22 19:26:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:26:09,987 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 324 transitions. [2021-11-22 19:26:09,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 324 transitions. [2021-11-22 19:26:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-22 19:26:09,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:09,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:10,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-22 19:26:10,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 19:26:10,212 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 584470840, now seen corresponding path program 1 times [2021-11-22 19:26:10,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:10,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891376580] [2021-11-22 19:26:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:10,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:10,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:10,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:10,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 19:26:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:11,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-22 19:26:11,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:11,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:26:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:11,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 19:26:11,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891376580] [2021-11-22 19:26:11,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891376580] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 19:26:11,289 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:26:11,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-22 19:26:11,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317628387] [2021-11-22 19:26:11,290 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 19:26:11,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:26:11,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 19:26:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:26:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:26:11,292 INFO L87 Difference]: Start difference. First operand 256 states and 324 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:13,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:26:13,715 INFO L93 Difference]: Finished difference Result 486 states and 614 transitions. [2021-11-22 19:26:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:26:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-11-22 19:26:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:26:13,717 INFO L225 Difference]: With dead ends: 486 [2021-11-22 19:26:13,717 INFO L226 Difference]: Without dead ends: 256 [2021-11-22 19:26:13,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:26:13,719 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 449 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-22 19:26:13,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 450 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-22 19:26:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-22 19:26:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-22 19:26:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 239 states have (on average 1.3430962343096233) internal successors, (321), 255 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 321 transitions. [2021-11-22 19:26:13,732 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 321 transitions. Word has length 45 [2021-11-22 19:26:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:26:13,733 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 321 transitions. [2021-11-22 19:26:13,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 321 transitions. [2021-11-22 19:26:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 19:26:13,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:13,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:13,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-22 19:26:13,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 19:26:13,939 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -713327456, now seen corresponding path program 1 times [2021-11-22 19:26:13,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:13,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601646704] [2021-11-22 19:26:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:13,943 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:13,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:13,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:13,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 19:26:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:14,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 19:26:14,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:14,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:26:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:15,008 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 19:26:15,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601646704] [2021-11-22 19:26:15,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601646704] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 19:26:15,008 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:26:15,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-22 19:26:15,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117289257] [2021-11-22 19:26:15,009 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 19:26:15,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:26:15,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 19:26:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:26:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:26:15,010 INFO L87 Difference]: Start difference. First operand 256 states and 321 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:26:15,317 INFO L93 Difference]: Finished difference Result 567 states and 722 transitions. [2021-11-22 19:26:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:26:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-11-22 19:26:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:26:15,318 INFO L225 Difference]: With dead ends: 567 [2021-11-22 19:26:15,318 INFO L226 Difference]: Without dead ends: 336 [2021-11-22 19:26:15,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:26:15,320 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 178 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 19:26:15,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 861 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 19:26:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-22 19:26:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 272. [2021-11-22 19:26:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 255 states have (on average 1.3215686274509804) internal successors, (337), 271 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 337 transitions. [2021-11-22 19:26:15,340 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 337 transitions. Word has length 57 [2021-11-22 19:26:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:26:15,340 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 337 transitions. [2021-11-22 19:26:15,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 337 transitions. [2021-11-22 19:26:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 19:26:15,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:15,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:15,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 19:26:15,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 19:26:15,564 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -961473950, now seen corresponding path program 1 times [2021-11-22 19:26:15,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:15,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158247387] [2021-11-22 19:26:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:15,567 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:15,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 19:26:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:16,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-22 19:26:16,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:16,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-22 19:26:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:16,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:26:17,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2021-11-22 19:26:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:17,146 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 19:26:17,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158247387] [2021-11-22 19:26:17,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158247387] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 19:26:17,146 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:26:17,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 13 [2021-11-22 19:26:17,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459701599] [2021-11-22 19:26:17,147 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 19:26:17,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 19:26:17,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 19:26:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 19:26:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:26:17,148 INFO L87 Difference]: Start difference. First operand 272 states and 337 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:19,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:26:22,938 INFO L93 Difference]: Finished difference Result 829 states and 1040 transitions. [2021-11-22 19:26:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 19:26:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 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 57 [2021-11-22 19:26:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:26:22,942 INFO L225 Difference]: With dead ends: 829 [2021-11-22 19:26:22,942 INFO L226 Difference]: Without dead ends: 584 [2021-11-22 19:26:22,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2021-11-22 19:26:22,944 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 581 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-22 19:26:22,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 5224 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 984 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2021-11-22 19:26:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-11-22 19:26:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 270. [2021-11-22 19:26:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 253 states have (on average 1.3201581027667983) internal successors, (334), 269 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 334 transitions. [2021-11-22 19:26:22,956 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 334 transitions. Word has length 57 [2021-11-22 19:26:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:26:22,957 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 334 transitions. [2021-11-22 19:26:22,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 334 transitions. [2021-11-22 19:26:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-22 19:26:22,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:22,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:22,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 19:26:23,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 19:26:23,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 819104920, now seen corresponding path program 1 times [2021-11-22 19:26:23,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:23,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870541567] [2021-11-22 19:26:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:23,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:23,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:23,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:23,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 19:26:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:23,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 19:26:24,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:24,252 INFO L354 Elim1Store]: treesize reduction 336, result has 0.3 percent of original size [2021-11-22 19:26:24,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 203 treesize of output 59 [2021-11-22 19:26:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:24,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:26:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:24,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 19:26:24,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870541567] [2021-11-22 19:26:24,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870541567] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 19:26:24,758 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:26:24,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-22 19:26:24,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950547254] [2021-11-22 19:26:24,759 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 19:26:24,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:26:24,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 19:26:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:26:24,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:26:24,760 INFO L87 Difference]: Start difference. First operand 270 states and 334 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:27,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:29,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:31,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:26:37,076 INFO L93 Difference]: Finished difference Result 828 states and 1018 transitions. [2021-11-22 19:26:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:26:37,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 61 [2021-11-22 19:26:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:26:37,081 INFO L225 Difference]: With dead ends: 828 [2021-11-22 19:26:37,081 INFO L226 Difference]: Without dead ends: 578 [2021-11-22 19:26:37,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:26:37,083 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 657 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:26:37,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 1414 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 587 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2021-11-22 19:26:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-11-22 19:26:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 324. [2021-11-22 19:26:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 307 states have (on average 1.3127035830618892) internal successors, (403), 323 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 403 transitions. [2021-11-22 19:26:37,095 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 403 transitions. Word has length 61 [2021-11-22 19:26:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:26:37,096 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 403 transitions. [2021-11-22 19:26:37,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 403 transitions. [2021-11-22 19:26:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-22 19:26:37,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:37,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:37,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-22 19:26:37,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 19:26:37,312 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash -78288358, now seen corresponding path program 1 times [2021-11-22 19:26:37,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:37,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527005196] [2021-11-22 19:26:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:37,314 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:37,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:37,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-22 19:26:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:38,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-22 19:26:38,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:38,315 INFO L354 Elim1Store]: treesize reduction 336, result has 0.3 percent of original size [2021-11-22 19:26:38,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 203 treesize of output 59 [2021-11-22 19:26:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:38,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:26:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:39,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 19:26:39,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527005196] [2021-11-22 19:26:39,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527005196] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 19:26:39,100 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:26:39,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2021-11-22 19:26:39,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329656194] [2021-11-22 19:26:39,100 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 19:26:39,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:26:39,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 19:26:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:26:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:26:39,101 INFO L87 Difference]: Start difference. First operand 324 states and 403 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:42,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:43,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 19:26:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:26:53,414 INFO L93 Difference]: Finished difference Result 1047 states and 1234 transitions. [2021-11-22 19:26:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-22 19:26:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 61 [2021-11-22 19:26:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:26:53,421 INFO L225 Difference]: With dead ends: 1047 [2021-11-22 19:26:53,421 INFO L226 Difference]: Without dead ends: 666 [2021-11-22 19:26:53,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-11-22 19:26:53,423 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 813 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:26:53,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 3176 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2021-11-22 19:26:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-11-22 19:26:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 318. [2021-11-22 19:26:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 301 states have (on average 1.2591362126245846) internal successors, (379), 317 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 379 transitions. [2021-11-22 19:26:53,435 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 379 transitions. Word has length 61 [2021-11-22 19:26:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:26:53,435 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 379 transitions. [2021-11-22 19:26:53,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:26:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 379 transitions. [2021-11-22 19:26:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 19:26:53,437 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:26:53,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:26:53,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-22 19:26:53,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 19:26:53,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-22 19:26:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:26:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1837285508, now seen corresponding path program 1 times [2021-11-22 19:26:53,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 19:26:53,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737061080] [2021-11-22 19:26:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:26:53,645 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 19:26:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 19:26:53,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 19:26:53,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-22 19:26:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:26:54,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-22 19:26:54,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 19:26:56,317 INFO L354 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2021-11-22 19:26:56,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 28 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 197 treesize of output 69 [2021-11-22 19:26:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 19:26:56,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 19:27:23,222 WARN L227 SmtUtils]: Spent 24.14s on a formula simplification. DAG size of input: 1166 DAG size of output: 513 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-22 19:27:23,238 INFO L354 Elim1Store]: treesize reduction 2280, result has 39.2 percent of original size [2021-11-22 19:27:23,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 252 treesize of output 1538 Killed by 15