./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_cursor_advance_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 f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:53:16,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:53:16,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:53:16,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:53:16,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:53:16,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:53:16,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:53:16,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:53:16,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:53:16,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:53:16,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:53:16,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:53:16,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:53:16,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:53:16,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:53:16,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:53:16,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:53:16,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:53:16,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:53:16,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:53:16,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:53:16,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:53:16,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:53:16,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:53:16,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:53:16,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:53:16,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:53:16,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:53:16,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:53:16,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:53:16,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:53:16,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:53:16,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:53:16,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:53:16,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:53:16,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:53:16,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:53:16,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:53:16,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:53:16,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:53:16,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:53:16,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 12:53:16,456 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:53:16,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:53:16,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:53:16,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:53:16,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:53:16,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:53:16,459 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:53:16,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:53:16,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 12:53:16,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:53:16,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:53:16,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:53:16,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:53:16,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:53:16,461 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:53:16,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:53:16,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:53:16,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:53:16,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:53:16,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:53:16,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:53:16,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:53:16,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:53:16,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 12:53:16,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 12:53:16,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:53:16,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:53:16,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:53:16,464 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:53:16,464 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 -> f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 [2021-11-02 12:53:16,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:53:16,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:53:16,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:53:16,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:53:16,707 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:53:16,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2021-11-02 12:53:16,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e2dd8ef/c2177ebb8659413381875b9f2fc66695/FLAG3656beb28 [2021-11-02 12:53:17,421 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:53:17,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2021-11-02 12:53:17,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e2dd8ef/c2177ebb8659413381875b9f2fc66695/FLAG3656beb28 [2021-11-02 12:53:17,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e2dd8ef/c2177ebb8659413381875b9f2fc66695 [2021-11-02 12:53:17,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:53:17,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:53:17,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:53:17,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:53:17,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:53:17,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:53:17" (1/1) ... [2021-11-02 12:53:17,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd14aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:17, skipping insertion in model container [2021-11-02 12:53:17,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:53:17" (1/1) ... [2021-11-02 12:53:17,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:53:17,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:53:17,914 WARN L228 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_cursor_advance_harness.i[4497,4510] [2021-11-02 12:53:17,920 WARN L228 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_cursor_advance_harness.i[4557,4570] [2021-11-02 12:53:17,938 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:53:17,948 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:53:18,505 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,506 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,506 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,506 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,507 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,514 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,520 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,523 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,524 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,723 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:53:18,724 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:53:18,726 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:53:18,728 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:53:18,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:53:18,735 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:53:18,737 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:53:18,737 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:53:18,739 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:53:18,740 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:53:18,866 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:53:18,963 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:18,964 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:53:19,070 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:53:19,088 WARN L228 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_cursor_advance_harness.i[4497,4510] [2021-11-02 12:53:19,090 WARN L228 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_cursor_advance_harness.i[4557,4570] [2021-11-02 12:53:19,091 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:53:19,093 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:53:19,118 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,118 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,118 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,119 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,120 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,125 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,125 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,126 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,126 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,146 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:53:19,147 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:53:19,147 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:53:19,147 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:53:19,148 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:53:19,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:53:19,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:53:19,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:53:19,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:53:19,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:53:19,176 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:53:19,277 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,277 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:53:19,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:53:19,455 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:53:19,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19 WrapperNode [2021-11-02 12:53:19,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:53:19,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:53:19,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:53:19,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:53:19,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:53:19,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:53:19,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:53:19,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:53:19,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:53:19,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:53:19,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:53:19,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:53:19,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (1/1) ... [2021-11-02 12:53:19,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:53:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:53:19,768 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-02 12:53:19,801 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-02 12:53:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:53:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 12:53:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:53:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:53:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:53:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:53:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:53:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:53:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:53:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 12:53:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 12:53:24,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:53:24,456 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-11-02 12:53:24,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:53:24 BoogieIcfgContainer [2021-11-02 12:53:24,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:53:24,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:53:24,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:53:24,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:53:24,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:53:17" (1/3) ... [2021-11-02 12:53:24,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88f62bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:53:24, skipping insertion in model container [2021-11-02 12:53:24,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:53:19" (2/3) ... [2021-11-02 12:53:24,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88f62bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:53:24, skipping insertion in model container [2021-11-02 12:53:24,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:53:24" (3/3) ... [2021-11-02 12:53:24,472 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_harness.i [2021-11-02 12:53:24,478 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:53:24,479 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-11-02 12:53:24,520 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:53:24,525 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-02 12:53:24,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-02 12:53:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 126 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 12:53:24,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:24,553 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] [2021-11-02 12:53:24,554 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:53:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -443327314, now seen corresponding path program 1 times [2021-11-02 12:53:24,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:24,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837505589] [2021-11-02 12:53:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:24,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:25,120 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-02 12:53:25,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:25,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837505589] [2021-11-02 12:53:25,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837505589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:25,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:25,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:53:25,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761620674] [2021-11-02 12:53:25,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:53:25,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:53:25,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:53:25,156 INFO L87 Difference]: Start difference. First operand has 127 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 126 states have internal predecessors, (173), 0 states have call successors, (0), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:27,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:28,482 INFO L93 Difference]: Finished difference Result 249 states and 339 transitions. [2021-11-02 12:53:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:53:28,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-02 12:53:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:28,489 INFO L225 Difference]: With dead ends: 249 [2021-11-02 12:53:28,489 INFO L226 Difference]: Without dead ends: 119 [2021-11-02 12:53:28,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.94ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:53:28,494 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2908.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.06ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3255.41ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:28,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 8.06ms Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 1 Unknown, 0 Unchecked, 3255.41ms Time] [2021-11-02 12:53:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-02 12:53:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-02 12:53:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 118 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-02 12:53:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2021-11-02 12:53:28,536 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 26 [2021-11-02 12:53:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:28,536 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2021-11-02 12:53:28,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2021-11-02 12:53:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 12:53:28,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:28,538 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] [2021-11-02 12:53:28,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 12:53:28,539 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:53:28,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1924042484, now seen corresponding path program 1 times [2021-11-02 12:53:28,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:28,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084141454] [2021-11-02 12:53:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:28,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:28,799 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-02 12:53:28,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:28,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084141454] [2021-11-02 12:53:28,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084141454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:28,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:28,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:53:28,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138887226] [2021-11-02 12:53:28,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:53:28,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:53:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:53:28,801 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:30,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:32,131 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2021-11-02 12:53:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:53:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-11-02 12:53:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:32,133 INFO L225 Difference]: With dead ends: 186 [2021-11-02 12:53:32,133 INFO L226 Difference]: Without dead ends: 119 [2021-11-02 12:53:32,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 137.83ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:53:32,134 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 292 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2879.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.98ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3201.65ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:32,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 0 Invalid, 261 Unknown, 0 Unchecked, 7.98ms Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 1 Unknown, 0 Unchecked, 3201.65ms Time] [2021-11-02 12:53:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-02 12:53:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-11-02 12:53:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 118 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-02 12:53:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-11-02 12:53:32,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 30 [2021-11-02 12:53:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:32,151 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-11-02 12:53:32,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-11-02 12:53:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 12:53:32,153 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:32,153 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] [2021-11-02 12:53:32,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 12:53:32,153 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:53:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 434837223, now seen corresponding path program 1 times [2021-11-02 12:53:32,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:32,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975963376] [2021-11-02 12:53:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:32,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:32,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-02 12:53:32,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:32,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975963376] [2021-11-02 12:53:32,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975963376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:32,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:32,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:53:32,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368090499] [2021-11-02 12:53:32,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:53:32,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:32,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:53:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:53:32,721 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:34,768 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:37,965 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2021-11-02 12:53:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:53:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-11-02 12:53:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:37,967 INFO L225 Difference]: With dead ends: 217 [2021-11-02 12:53:37,967 INFO L226 Difference]: Without dead ends: 211 [2021-11-02 12:53:37,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 265.86ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:53:37,968 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4642.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.23ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5015.25ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:37,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 897 Unknown, 0 Unchecked, 14.23ms Time], IncrementalHoareTripleChecker [35 Valid, 861 Invalid, 1 Unknown, 0 Unchecked, 5015.25ms Time] [2021-11-02 12:53:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-02 12:53:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 131. [2021-11-02 12:53:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 130 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2021-11-02 12:53:37,980 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 32 [2021-11-02 12:53:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:37,981 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2021-11-02 12:53:37,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2021-11-02 12:53:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:53:37,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:37,982 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] [2021-11-02 12:53:37,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 12:53:37,983 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:53:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2134165153, now seen corresponding path program 1 times [2021-11-02 12:53:37,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:37,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402937258] [2021-11-02 12:53:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:37,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:39,122 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-02 12:53:39,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:39,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402937258] [2021-11-02 12:53:39,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402937258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:39,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:39,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:53:39,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895855669] [2021-11-02 12:53:39,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:53:39,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:53:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:53:39,139 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:41,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:48,214 INFO L93 Difference]: Finished difference Result 335 states and 397 transitions. [2021-11-02 12:53:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-02 12:53:48,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-11-02 12:53:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:48,217 INFO L225 Difference]: With dead ends: 335 [2021-11-02 12:53:48,217 INFO L226 Difference]: Without dead ends: 233 [2021-11-02 12:53:48,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2804.89ms TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2021-11-02 12:53:48,219 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 526 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6206.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.42ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6691.48ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:48,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 0 Invalid, 1413 Unknown, 0 Unchecked, 24.42ms Time], IncrementalHoareTripleChecker [44 Valid, 1368 Invalid, 1 Unknown, 0 Unchecked, 6691.48ms Time] [2021-11-02 12:53:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-02 12:53:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 150. [2021-11-02 12:53:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 149 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2021-11-02 12:53:48,230 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 36 [2021-11-02 12:53:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:48,230 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2021-11-02 12:53:48,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2021-11-02 12:53:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:53:48,236 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:48,236 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] [2021-11-02 12:53:48,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 12:53:48,241 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:53:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1573996129, now seen corresponding path program 1 times [2021-11-02 12:53:48,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:48,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523769832] [2021-11-02 12:53:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:48,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:48,478 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-02 12:53:48,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:48,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523769832] [2021-11-02 12:53:48,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523769832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:48,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:48,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 12:53:48,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218073748] [2021-11-02 12:53:48,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 12:53:48,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 12:53:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:53:48,483 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:50,537 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:51,735 INFO L93 Difference]: Finished difference Result 241 states and 286 transitions. [2021-11-02 12:53:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 12:53:51,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-11-02 12:53:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:51,737 INFO L225 Difference]: With dead ends: 241 [2021-11-02 12:53:51,737 INFO L226 Difference]: Without dead ends: 152 [2021-11-02 12:53:51,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:53:51,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2941.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3226.42ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:51,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 3226.42ms Time] [2021-11-02 12:53:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-11-02 12:53:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-11-02 12:53:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2021-11-02 12:53:51,766 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 36 [2021-11-02 12:53:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:51,767 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2021-11-02 12:53:51,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2021-11-02 12:53:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:53:51,769 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:51,769 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] [2021-11-02 12:53:51,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 12:53:51,769 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:53:51,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash 562878879, now seen corresponding path program 1 times [2021-11-02 12:53:51,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:51,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999630530] [2021-11-02 12:53:51,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:51,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:53,337 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-02 12:53:53,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:53,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999630530] [2021-11-02 12:53:53,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999630530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:53,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:53,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 12:53:53,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138067183] [2021-11-02 12:53:53,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:53:53,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:53:53,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:53:53,338 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:55,387 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:03,712 INFO L93 Difference]: Finished difference Result 523 states and 623 transitions. [2021-11-02 12:54:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 12:54:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-11-02 12:54:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:03,714 INFO L225 Difference]: With dead ends: 523 [2021-11-02 12:54:03,714 INFO L226 Difference]: Without dead ends: 442 [2021-11-02 12:54:03,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 3996.27ms TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2021-11-02 12:54:03,715 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1246 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6437.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.78ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6921.86ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:03,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 0 Invalid, 1406 Unknown, 0 Unchecked, 23.78ms Time], IncrementalHoareTripleChecker [57 Valid, 1348 Invalid, 1 Unknown, 0 Unchecked, 6921.86ms Time] [2021-11-02 12:54:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-11-02 12:54:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 164. [2021-11-02 12:54:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 163 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-11-02 12:54:03,727 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 36 [2021-11-02 12:54:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:03,728 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-11-02 12:54:03,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-11-02 12:54:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:54:03,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:03,732 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] [2021-11-02 12:54:03,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 12:54:03,732 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1242937249, now seen corresponding path program 1 times [2021-11-02 12:54:03,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:03,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119813990] [2021-11-02 12:54:03,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:03,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:07,158 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-02 12:54:07,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:07,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119813990] [2021-11-02 12:54:07,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119813990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:07,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:07,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 12:54:07,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228417817] [2021-11-02 12:54:07,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 12:54:07,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 12:54:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:54:07,161 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:09,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:17,998 INFO L93 Difference]: Finished difference Result 398 states and 463 transitions. [2021-11-02 12:54:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-02 12:54:17,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-11-02 12:54:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:18,000 INFO L225 Difference]: With dead ends: 398 [2021-11-02 12:54:18,000 INFO L226 Difference]: Without dead ends: 316 [2021-11-02 12:54:18,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 4449.28ms TimeCoverageRelationStatistics Valid=382, Invalid=1340, Unknown=0, NotChecked=0, Total=1722 [2021-11-02 12:54:18,003 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 991 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6450.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.32ms SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7004.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:18,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [991 Valid, 0 Invalid, 1506 Unknown, 0 Unchecked, 17.32ms Time], IncrementalHoareTripleChecker [69 Valid, 1436 Invalid, 1 Unknown, 0 Unchecked, 7004.34ms Time] [2021-11-02 12:54:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-02 12:54:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 164. [2021-11-02 12:54:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 163 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-11-02 12:54:18,014 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 36 [2021-11-02 12:54:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:18,014 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-11-02 12:54:18,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-11-02 12:54:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 12:54:18,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:18,020 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] [2021-11-02 12:54:18,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 12:54:18,021 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1581952149, now seen corresponding path program 1 times [2021-11-02 12:54:18,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:18,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351398036] [2021-11-02 12:54:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:18,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:18,268 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-02 12:54:18,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:18,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351398036] [2021-11-02 12:54:18,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351398036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:18,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:18,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:54:18,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393162435] [2021-11-02 12:54:18,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:54:18,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:54:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:54:18,270 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:21,359 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:22,916 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2021-11-02 12:54:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:54:22,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-02 12:54:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:22,917 INFO L225 Difference]: With dead ends: 220 [2021-11-02 12:54:22,918 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 12:54:22,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:54:22,918 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4126.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.16ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4592.01ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:22,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 330 Unknown, 0 Unchecked, 3.16ms Time], IncrementalHoareTripleChecker [4 Valid, 325 Invalid, 1 Unknown, 0 Unchecked, 4592.01ms Time] [2021-11-02 12:54:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 12:54:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-11-02 12:54:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 163 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2021-11-02 12:54:22,926 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 37 [2021-11-02 12:54:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:22,927 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2021-11-02 12:54:22,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2021-11-02 12:54:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:54:22,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:22,928 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] [2021-11-02 12:54:22,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 12:54:22,928 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:22,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1129134319, now seen corresponding path program 1 times [2021-11-02 12:54:22,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:22,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157388698] [2021-11-02 12:54:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:22,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:23,295 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-02 12:54:23,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:23,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157388698] [2021-11-02 12:54:23,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157388698] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:23,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:23,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:54:23,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254391127] [2021-11-02 12:54:23,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:54:23,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:54:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:54:23,296 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:25,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:27,566 INFO L93 Difference]: Finished difference Result 359 states and 421 transitions. [2021-11-02 12:54:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:54:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-11-02 12:54:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:27,568 INFO L225 Difference]: With dead ends: 359 [2021-11-02 12:54:27,568 INFO L226 Difference]: Without dead ends: 238 [2021-11-02 12:54:27,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 331.19ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:54:27,569 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3649.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4023.07ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:27,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 544 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [18 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 4023.07ms Time] [2021-11-02 12:54:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-02 12:54:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2021-11-02 12:54:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 163 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2021-11-02 12:54:27,575 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 39 [2021-11-02 12:54:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:27,575 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2021-11-02 12:54:27,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2021-11-02 12:54:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 12:54:27,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:27,576 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] [2021-11-02 12:54:27,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 12:54:27,576 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 494964265, now seen corresponding path program 1 times [2021-11-02 12:54:27,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:27,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494231063] [2021-11-02 12:54:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:27,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:28,039 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-02 12:54:28,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:28,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494231063] [2021-11-02 12:54:28,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494231063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:28,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:28,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:54:28,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599694436] [2021-11-02 12:54:28,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:54:28,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:28,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:54:28,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:54:28,041 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:31,179 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:34,081 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2021-11-02 12:54:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:54:34,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-02 12:54:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:34,082 INFO L225 Difference]: With dead ends: 264 [2021-11-02 12:54:34,082 INFO L226 Difference]: Without dead ends: 167 [2021-11-02 12:54:34,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 352.89ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:54:34,083 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5305.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.54ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5845.95ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:34,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 762 Unknown, 0 Unchecked, 7.54ms Time], IncrementalHoareTripleChecker [20 Valid, 741 Invalid, 1 Unknown, 0 Unchecked, 5845.95ms Time] [2021-11-02 12:54:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-02 12:54:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-11-02 12:54:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.2547770700636942) internal successors, (197), 166 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2021-11-02 12:54:34,089 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 40 [2021-11-02 12:54:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:34,089 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2021-11-02 12:54:34,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2021-11-02 12:54:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 12:54:34,089 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:34,089 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] [2021-11-02 12:54:34,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 12:54:34,090 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:34,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1560368280, now seen corresponding path program 1 times [2021-11-02 12:54:34,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:34,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409609559] [2021-11-02 12:54:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:34,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:34,347 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-02 12:54:34,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:34,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409609559] [2021-11-02 12:54:34,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409609559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:34,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:34,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:54:34,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061721595] [2021-11-02 12:54:34,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:54:34,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:54:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:54:34,349 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:37,620 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:40,131 INFO L93 Difference]: Finished difference Result 265 states and 309 transitions. [2021-11-02 12:54:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:54:40,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-02 12:54:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:40,133 INFO L225 Difference]: With dead ends: 265 [2021-11-02 12:54:40,133 INFO L226 Difference]: Without dead ends: 202 [2021-11-02 12:54:40,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 165.62ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:54:40,134 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5119.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.18ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5637.82ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:40,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 578 Unknown, 0 Unchecked, 5.18ms Time], IncrementalHoareTripleChecker [7 Valid, 570 Invalid, 1 Unknown, 0 Unchecked, 5637.82ms Time] [2021-11-02 12:54:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-02 12:54:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2021-11-02 12:54:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 184 states have (on average 1.25) internal successors, (230), 193 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2021-11-02 12:54:40,140 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 43 [2021-11-02 12:54:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:40,140 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2021-11-02 12:54:40,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2021-11-02 12:54:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 12:54:40,141 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:40,141 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] [2021-11-02 12:54:40,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 12:54:40,141 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1955314904, now seen corresponding path program 1 times [2021-11-02 12:54:40,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:40,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435415439] [2021-11-02 12:54:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:40,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:41,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-02 12:54:41,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:41,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435415439] [2021-11-02 12:54:41,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435415439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:41,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:41,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 12:54:41,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393165245] [2021-11-02 12:54:41,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 12:54:41,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 12:54:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:54:41,708 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:45,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:56,835 INFO L93 Difference]: Finished difference Result 343 states and 401 transitions. [2021-11-02 12:54:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-02 12:54:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-02 12:54:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:56,837 INFO L225 Difference]: With dead ends: 343 [2021-11-02 12:54:56,837 INFO L226 Difference]: Without dead ends: 281 [2021-11-02 12:54:56,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 5057.46ms TimeCoverageRelationStatistics Valid=515, Invalid=2241, Unknown=0, NotChecked=0, Total=2756 [2021-11-02 12:54:56,838 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 850 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10119.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 29.89ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10940.90ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:56,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [850 Valid, 0 Invalid, 2302 Unknown, 0 Unchecked, 29.89ms Time], IncrementalHoareTripleChecker [77 Valid, 2224 Invalid, 1 Unknown, 0 Unchecked, 10940.90ms Time] [2021-11-02 12:54:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-02 12:54:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 202. [2021-11-02 12:54:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 201 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 239 transitions. [2021-11-02 12:54:56,845 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 239 transitions. Word has length 43 [2021-11-02 12:54:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:56,845 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 239 transitions. [2021-11-02 12:54:56,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2021-11-02 12:54:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 12:54:56,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:56,846 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] [2021-11-02 12:54:56,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 12:54:56,847 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:54:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1275256534, now seen corresponding path program 1 times [2021-11-02 12:54:56,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:54:56,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006420176] [2021-11-02 12:54:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:56,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:54:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:59,571 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-02 12:54:59,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:54:59,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006420176] [2021-11-02 12:54:59,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006420176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:59,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:59,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 12:54:59,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084190044] [2021-11-02 12:54:59,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 12:54:59,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 12:54:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-02 12:54:59,573 INFO L87 Difference]: Start difference. First operand 202 states and 239 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:02,654 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:11,195 INFO L93 Difference]: Finished difference Result 398 states and 456 transitions. [2021-11-02 12:55:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-02 12:55:11,196 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-02 12:55:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:11,197 INFO L225 Difference]: With dead ends: 398 [2021-11-02 12:55:11,197 INFO L226 Difference]: Without dead ends: 315 [2021-11-02 12:55:11,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3736.02ms TimeCoverageRelationStatistics Valid=372, Invalid=1268, Unknown=0, NotChecked=0, Total=1640 [2021-11-02 12:55:11,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 736 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7852.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.51ms SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8530.24ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:11,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 0 Invalid, 1610 Unknown, 0 Unchecked, 22.51ms Time], IncrementalHoareTripleChecker [70 Valid, 1539 Invalid, 1 Unknown, 0 Unchecked, 8530.24ms Time] [2021-11-02 12:55:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-02 12:55:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 186. [2021-11-02 12:55:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 176 states have (on average 1.2556818181818181) internal successors, (221), 185 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2021-11-02 12:55:11,206 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 43 [2021-11-02 12:55:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:11,206 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2021-11-02 12:55:11,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2021-11-02 12:55:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 12:55:11,207 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:11,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] [2021-11-02 12:55:11,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 12:55:11,208 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1614341239, now seen corresponding path program 1 times [2021-11-02 12:55:11,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:11,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128010480] [2021-11-02 12:55:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:11,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:12,010 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-02 12:55:12,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:12,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128010480] [2021-11-02 12:55:12,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128010480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:12,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:12,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:55:12,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695228032] [2021-11-02 12:55:12,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:55:12,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:55:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:55:12,012 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:15,099 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:20,117 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2021-11-02 12:55:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 12:55:20,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-02 12:55:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:20,118 INFO L225 Difference]: With dead ends: 278 [2021-11-02 12:55:20,118 INFO L226 Difference]: Without dead ends: 175 [2021-11-02 12:55:20,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1139.49ms TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2021-11-02 12:55:20,119 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 336 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6735.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.04ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7354.24ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:20,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 0 Invalid, 1233 Unknown, 0 Unchecked, 12.04ms Time], IncrementalHoareTripleChecker [49 Valid, 1183 Invalid, 1 Unknown, 0 Unchecked, 7354.24ms Time] [2021-11-02 12:55:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-02 12:55:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2021-11-02 12:55:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 162 states have (on average 1.2530864197530864) internal successors, (203), 171 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2021-11-02 12:55:20,125 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 43 [2021-11-02 12:55:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:20,125 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2021-11-02 12:55:20,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2021-11-02 12:55:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 12:55:20,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:20,126 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] [2021-11-02 12:55:20,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 12:55:20,126 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash 248645983, now seen corresponding path program 1 times [2021-11-02 12:55:20,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:20,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580786370] [2021-11-02 12:55:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:20,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:20,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-02 12:55:20,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:20,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580786370] [2021-11-02 12:55:20,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580786370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:20,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:20,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 12:55:20,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979284997] [2021-11-02 12:55:20,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:55:20,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:20,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:55:20,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:55:20,516 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:22,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:26,037 INFO L93 Difference]: Finished difference Result 375 states and 431 transitions. [2021-11-02 12:55:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:55:26,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-11-02 12:55:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:26,040 INFO L225 Difference]: With dead ends: 375 [2021-11-02 12:55:26,040 INFO L226 Difference]: Without dead ends: 234 [2021-11-02 12:55:26,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 235.20ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:55:26,041 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4901.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.83ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5364.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:26,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 922 Unknown, 0 Unchecked, 8.83ms Time], IncrementalHoareTripleChecker [29 Valid, 892 Invalid, 1 Unknown, 0 Unchecked, 5364.34ms Time] [2021-11-02 12:55:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-11-02 12:55:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 172. [2021-11-02 12:55:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 162 states have (on average 1.2407407407407407) internal successors, (201), 171 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2021-11-02 12:55:26,047 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 44 [2021-11-02 12:55:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:26,047 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2021-11-02 12:55:26,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2021-11-02 12:55:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 12:55:26,048 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:26,048 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-02 12:55:26,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 12:55:26,048 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1723612779, now seen corresponding path program 1 times [2021-11-02 12:55:26,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:26,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283288129] [2021-11-02 12:55:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:26,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:26,247 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-02 12:55:26,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:26,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283288129] [2021-11-02 12:55:26,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283288129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:26,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:26,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:55:26,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047475231] [2021-11-02 12:55:26,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:55:26,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:55:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:55:26,249 INFO L87 Difference]: Start difference. First operand 172 states and 201 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-02 12:55:29,371 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:30,576 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2021-11-02 12:55:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:55:30,577 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-02 12:55:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:30,578 INFO L225 Difference]: With dead ends: 208 [2021-11-02 12:55:30,578 INFO L226 Difference]: Without dead ends: 172 [2021-11-02 12:55:30,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.27ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:55:30,578 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3848.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.48ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4283.06ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:30,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 2.48ms Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 1 Unknown, 0 Unchecked, 4283.06ms Time] [2021-11-02 12:55:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-02 12:55:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-11-02 12:55:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 171 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2021-11-02 12:55:30,585 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 45 [2021-11-02 12:55:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:30,585 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2021-11-02 12:55:30,585 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-02 12:55:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2021-11-02 12:55:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-02 12:55:30,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:30,586 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] [2021-11-02 12:55:30,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 12:55:30,587 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1552271487, now seen corresponding path program 1 times [2021-11-02 12:55:30,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:30,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065221000] [2021-11-02 12:55:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:30,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:30,805 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-02 12:55:30,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:30,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065221000] [2021-11-02 12:55:30,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065221000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:30,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:30,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:55:30,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467757256] [2021-11-02 12:55:30,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:55:30,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:55:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:55:30,806 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:34,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:36,312 INFO L93 Difference]: Finished difference Result 345 states and 395 transitions. [2021-11-02 12:55:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:55:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-11-02 12:55:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:36,314 INFO L225 Difference]: With dead ends: 345 [2021-11-02 12:55:36,314 INFO L226 Difference]: Without dead ends: 208 [2021-11-02 12:55:36,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.72ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:55:36,314 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4937.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5449.06ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:36,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [21 Valid, 554 Invalid, 1 Unknown, 0 Unchecked, 5449.06ms Time] [2021-11-02 12:55:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-02 12:55:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 172. [2021-11-02 12:55:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 171 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2021-11-02 12:55:36,321 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 48 [2021-11-02 12:55:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:36,322 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2021-11-02 12:55:36,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2021-11-02 12:55:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-02 12:55:36,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:36,323 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] [2021-11-02 12:55:36,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 12:55:36,323 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1864309569, now seen corresponding path program 1 times [2021-11-02 12:55:36,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:36,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064266263] [2021-11-02 12:55:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:36,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:38,876 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-02 12:55:38,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:38,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064266263] [2021-11-02 12:55:38,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064266263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:38,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:38,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 12:55:38,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894493655] [2021-11-02 12:55:38,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 12:55:38,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 12:55:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:55:38,878 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:41,920 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:47,799 INFO L93 Difference]: Finished difference Result 464 states and 523 transitions. [2021-11-02 12:55:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 12:55:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-11-02 12:55:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:47,801 INFO L225 Difference]: With dead ends: 464 [2021-11-02 12:55:47,801 INFO L226 Difference]: Without dead ends: 338 [2021-11-02 12:55:47,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1688.88ms TimeCoverageRelationStatistics Valid=159, Invalid=303, Unknown=0, NotChecked=0, Total=462 [2021-11-02 12:55:47,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7016.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.14ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7682.22ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:47,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 1198 Unknown, 0 Unchecked, 15.14ms Time], IncrementalHoareTripleChecker [21 Valid, 1176 Invalid, 1 Unknown, 0 Unchecked, 7682.22ms Time] [2021-11-02 12:55:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-02 12:55:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 183. [2021-11-02 12:55:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 182 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2021-11-02 12:55:47,810 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 48 [2021-11-02 12:55:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:47,810 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2021-11-02 12:55:47,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2021-11-02 12:55:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-02 12:55:47,810 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:47,811 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] [2021-11-02 12:55:47,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 12:55:47,811 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1058850429, now seen corresponding path program 1 times [2021-11-02 12:55:47,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:47,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468347603] [2021-11-02 12:55:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:47,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:47,970 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-02 12:55:47,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:47,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468347603] [2021-11-02 12:55:47,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468347603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:47,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:47,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:55:47,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989570370] [2021-11-02 12:55:47,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:55:47,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:47,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:55:47,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:55:47,972 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:50,035 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:51,722 INFO L93 Difference]: Finished difference Result 346 states and 388 transitions. [2021-11-02 12:55:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:55:51,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-11-02 12:55:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:51,723 INFO L225 Difference]: With dead ends: 346 [2021-11-02 12:55:51,723 INFO L226 Difference]: Without dead ends: 204 [2021-11-02 12:55:51,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.68ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:55:51,724 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3372.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.39ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3703.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:51,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 451 Unknown, 0 Unchecked, 3.39ms Time], IncrementalHoareTripleChecker [15 Valid, 435 Invalid, 1 Unknown, 0 Unchecked, 3703.34ms Time] [2021-11-02 12:55:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-11-02 12:55:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 180. [2021-11-02 12:55:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 170 states have (on average 1.1705882352941177) internal successors, (199), 179 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2021-11-02 12:55:51,729 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 48 [2021-11-02 12:55:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:51,730 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2021-11-02 12:55:51,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2021-11-02 12:55:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:55:51,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:51,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] [2021-11-02 12:55:51,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 12:55:51,730 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 918000232, now seen corresponding path program 1 times [2021-11-02 12:55:51,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:51,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461248753] [2021-11-02 12:55:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:51,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:52,031 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-02 12:55:52,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:52,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461248753] [2021-11-02 12:55:52,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461248753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:52,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:52,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:55:52,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880945136] [2021-11-02 12:55:52,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:55:52,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:52,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:55:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:55:52,033 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:55,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:57,764 INFO L93 Difference]: Finished difference Result 280 states and 301 transitions. [2021-11-02 12:55:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:55:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:55:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:57,766 INFO L225 Difference]: With dead ends: 280 [2021-11-02 12:55:57,766 INFO L226 Difference]: Without dead ends: 235 [2021-11-02 12:55:57,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 254.34ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:55:57,767 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5042.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.66ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5532.76ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:57,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 670 Unknown, 0 Unchecked, 6.66ms Time], IncrementalHoareTripleChecker [10 Valid, 659 Invalid, 1 Unknown, 0 Unchecked, 5532.76ms Time] [2021-11-02 12:55:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-02 12:55:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 198. [2021-11-02 12:55:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 188 states have (on average 1.1542553191489362) internal successors, (217), 197 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 217 transitions. [2021-11-02 12:55:57,773 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 217 transitions. Word has length 51 [2021-11-02 12:55:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:57,773 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 217 transitions. [2021-11-02 12:55:57,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 217 transitions. [2021-11-02 12:55:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:55:57,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:57,774 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] [2021-11-02 12:55:57,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 12:55:57,774 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:55:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash 746971928, now seen corresponding path program 1 times [2021-11-02 12:55:57,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:55:57,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604331252] [2021-11-02 12:55:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:57,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:55:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:58,175 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-02 12:55:58,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:55:58,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604331252] [2021-11-02 12:55:58,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604331252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:58,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:58,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:55:58,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253873154] [2021-11-02 12:55:58,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:55:58,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:55:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:55:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:55:58,176 INFO L87 Difference]: Start difference. First operand 198 states and 217 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:01,365 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:04,055 INFO L93 Difference]: Finished difference Result 235 states and 253 transitions. [2021-11-02 12:56:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:56:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:56:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:04,056 INFO L225 Difference]: With dead ends: 235 [2021-11-02 12:56:04,056 INFO L226 Difference]: Without dead ends: 233 [2021-11-02 12:56:04,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 240.63ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:56:04,057 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5200.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.95ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5739.47ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:04,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 667 Unknown, 0 Unchecked, 6.95ms Time], IncrementalHoareTripleChecker [2 Valid, 664 Invalid, 1 Unknown, 0 Unchecked, 5739.47ms Time] [2021-11-02 12:56:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-02 12:56:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2021-11-02 12:56:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 196 states have (on average 1.1581632653061225) internal successors, (227), 205 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2021-11-02 12:56:04,064 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 51 [2021-11-02 12:56:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:04,064 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2021-11-02 12:56:04,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2021-11-02 12:56:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:56:04,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:04,065 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] [2021-11-02 12:56:04,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 12:56:04,065 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:56:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 747013634, now seen corresponding path program 1 times [2021-11-02 12:56:04,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:56:04,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110859111] [2021-11-02 12:56:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:04,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:56:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:04,224 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-02 12:56:04,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:56:04,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110859111] [2021-11-02 12:56:04,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110859111] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:04,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:04,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 12:56:04,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563098167] [2021-11-02 12:56:04,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 12:56:04,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:56:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 12:56:04,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:56:04,226 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:07,329 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:08,513 INFO L93 Difference]: Finished difference Result 223 states and 245 transitions. [2021-11-02 12:56:08,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 12:56:08,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:56:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:08,516 INFO L225 Difference]: With dead ends: 223 [2021-11-02 12:56:08,516 INFO L226 Difference]: Without dead ends: 208 [2021-11-02 12:56:08,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.31ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 12:56:08,516 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3844.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.90ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4266.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:08,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 1.90ms Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 1 Unknown, 0 Unchecked, 4266.34ms Time] [2021-11-02 12:56:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-02 12:56:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-11-02 12:56:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 198 states have (on average 1.1565656565656566) internal successors, (229), 207 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 229 transitions. [2021-11-02 12:56:08,522 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 229 transitions. Word has length 51 [2021-11-02 12:56:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:08,522 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 229 transitions. [2021-11-02 12:56:08,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 229 transitions. [2021-11-02 12:56:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:56:08,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:08,524 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] [2021-11-02 12:56:08,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 12:56:08,524 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:56:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash 747073216, now seen corresponding path program 1 times [2021-11-02 12:56:08,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:56:08,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477567680] [2021-11-02 12:56:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:08,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:56:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:09,646 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-02 12:56:09,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:56:09,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477567680] [2021-11-02 12:56:09,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477567680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:09,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:09,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 12:56:09,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213724985] [2021-11-02 12:56:09,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 12:56:09,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:56:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 12:56:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:56:09,648 INFO L87 Difference]: Start difference. First operand 208 states and 229 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:12,853 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:18,128 INFO L93 Difference]: Finished difference Result 294 states and 318 transitions. [2021-11-02 12:56:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:56:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:56:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:18,129 INFO L225 Difference]: With dead ends: 294 [2021-11-02 12:56:18,129 INFO L226 Difference]: Without dead ends: 292 [2021-11-02 12:56:18,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1303.49ms TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:56:18,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7005.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.17ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7644.41ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:18,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 1230 Unknown, 0 Unchecked, 14.17ms Time], IncrementalHoareTripleChecker [12 Valid, 1217 Invalid, 1 Unknown, 0 Unchecked, 7644.41ms Time] [2021-11-02 12:56:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-02 12:56:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 255. [2021-11-02 12:56:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 245 states have (on average 1.146938775510204) internal successors, (281), 254 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 281 transitions. [2021-11-02 12:56:18,138 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 281 transitions. Word has length 51 [2021-11-02 12:56:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:18,139 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 281 transitions. [2021-11-02 12:56:18,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 281 transitions. [2021-11-02 12:56:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:56:18,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:18,139 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] [2021-11-02 12:56:18,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 12:56:18,140 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:56:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1794730536, now seen corresponding path program 1 times [2021-11-02 12:56:18,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:56:18,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590905044] [2021-11-02 12:56:18,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:18,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:56:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:18,549 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-02 12:56:18,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:56:18,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590905044] [2021-11-02 12:56:18,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590905044] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:18,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:18,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:56:18,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048220534] [2021-11-02 12:56:18,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:56:18,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:56:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:56:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:56:18,550 INFO L87 Difference]: Start difference. First operand 255 states and 281 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:21,752 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:25,114 INFO L93 Difference]: Finished difference Result 343 states and 371 transitions. [2021-11-02 12:56:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:56:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:56:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:25,115 INFO L225 Difference]: With dead ends: 343 [2021-11-02 12:56:25,115 INFO L226 Difference]: Without dead ends: 297 [2021-11-02 12:56:25,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 474.43ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-02 12:56:25,116 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5696.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.65ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6225.86ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:25,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 9.65ms Time], IncrementalHoareTripleChecker [17 Valid, 866 Invalid, 1 Unknown, 0 Unchecked, 6225.86ms Time] [2021-11-02 12:56:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-02 12:56:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 259. [2021-11-02 12:56:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 249 states have (on average 1.144578313253012) internal successors, (285), 258 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2021-11-02 12:56:25,125 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 51 [2021-11-02 12:56:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:25,125 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2021-11-02 12:56:25,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2021-11-02 12:56:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:56:25,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:25,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] [2021-11-02 12:56:25,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 12:56:25,127 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:56:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1623702232, now seen corresponding path program 1 times [2021-11-02 12:56:25,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:56:25,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135500398] [2021-11-02 12:56:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:25,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:56:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:27,191 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-02 12:56:27,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:56:27,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135500398] [2021-11-02 12:56:27,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135500398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:27,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:27,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:56:27,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644654313] [2021-11-02 12:56:27,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:56:27,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:56:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:56:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:56:27,192 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:30,448 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:38,120 INFO L93 Difference]: Finished difference Result 382 states and 411 transitions. [2021-11-02 12:56:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:56:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:56:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:38,122 INFO L225 Difference]: With dead ends: 382 [2021-11-02 12:56:38,122 INFO L226 Difference]: Without dead ends: 366 [2021-11-02 12:56:38,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 3407.63ms TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2021-11-02 12:56:38,122 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7730.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.09ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8406.63ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:38,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 1418 Unknown, 0 Unchecked, 17.09ms Time], IncrementalHoareTripleChecker [48 Valid, 1369 Invalid, 1 Unknown, 0 Unchecked, 8406.63ms Time] [2021-11-02 12:56:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-02 12:56:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 321. [2021-11-02 12:56:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 311 states have (on average 1.1157556270096463) internal successors, (347), 320 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 347 transitions. [2021-11-02 12:56:38,141 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 347 transitions. Word has length 51 [2021-11-02 12:56:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:38,141 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 347 transitions. [2021-11-02 12:56:38,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 347 transitions. [2021-11-02 12:56:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:56:38,143 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:38,143 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] [2021-11-02 12:56:38,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 12:56:38,143 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:56:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1623761814, now seen corresponding path program 1 times [2021-11-02 12:56:38,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:56:38,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511137170] [2021-11-02 12:56:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:38,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:56:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:39,865 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-02 12:56:39,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:56:39,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511137170] [2021-11-02 12:56:39,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511137170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:39,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:39,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 12:56:39,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330483968] [2021-11-02 12:56:39,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 12:56:39,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:56:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 12:56:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:56:39,867 INFO L87 Difference]: Start difference. First operand 321 states and 347 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:42,908 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:52,568 INFO L93 Difference]: Finished difference Result 350 states and 375 transitions. [2021-11-02 12:56:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 12:56:52,569 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:56:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:52,570 INFO L225 Difference]: With dead ends: 350 [2021-11-02 12:56:52,570 INFO L226 Difference]: Without dead ends: 337 [2021-11-02 12:56:52,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3037.92ms TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2021-11-02 12:56:52,570 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9824.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.93ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10613.00ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:52,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 2235 Unknown, 0 Unchecked, 27.93ms Time], IncrementalHoareTripleChecker [33 Valid, 2201 Invalid, 1 Unknown, 0 Unchecked, 10613.00ms Time] [2021-11-02 12:56:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-11-02 12:56:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2021-11-02 12:56:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 312 states have (on average 1.1153846153846154) internal successors, (348), 321 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-02 12:56:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 348 transitions. [2021-11-02 12:56:52,583 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 348 transitions. Word has length 51 [2021-11-02 12:56:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:52,584 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 348 transitions. [2021-11-02 12:56:52,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 348 transitions. [2021-11-02 12:56:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:56:52,584 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:52,585 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] [2021-11-02 12:56:52,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-02 12:56:52,585 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:56:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1623803520, now seen corresponding path program 1 times [2021-11-02 12:56:52,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:56:52,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822149514] [2021-11-02 12:56:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:52,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:56:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:56,604 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-02 12:56:56,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:56:56,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822149514] [2021-11-02 12:56:56,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822149514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:56,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:56,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:56:56,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789104480] [2021-11-02 12:56:56,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:56:56,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:56:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:56:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:56:56,605 INFO L87 Difference]: Start difference. First operand 322 states and 348 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:59,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:06,826 INFO L93 Difference]: Finished difference Result 365 states and 390 transitions. [2021-11-02 12:57:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 12:57:06,827 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:57:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:06,828 INFO L225 Difference]: With dead ends: 365 [2021-11-02 12:57:06,828 INFO L226 Difference]: Without dead ends: 363 [2021-11-02 12:57:06,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2206.08ms TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:57:06,829 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8030.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.51ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8749.21ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:06,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 1671 Unknown, 0 Unchecked, 19.51ms Time], IncrementalHoareTripleChecker [34 Valid, 1636 Invalid, 1 Unknown, 0 Unchecked, 8749.21ms Time] [2021-11-02 12:57:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-11-02 12:57:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 322. [2021-11-02 12:57:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 312 states have (on average 1.1153846153846154) internal successors, (348), 321 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-02 12:57:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 348 transitions. [2021-11-02 12:57:06,841 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 348 transitions. Word has length 51 [2021-11-02 12:57:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:06,841 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 348 transitions. [2021-11-02 12:57:06,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 348 transitions. [2021-11-02 12:57:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:57:06,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:06,842 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] [2021-11-02 12:57:06,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-02 12:57:06,843 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:57:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -782709391, now seen corresponding path program 1 times [2021-11-02 12:57:06,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:57:06,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15641857] [2021-11-02 12:57:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:06,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:57:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:57:07,288 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-02 12:57:07,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:57:07,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15641857] [2021-11-02 12:57:07,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15641857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:57:07,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:57:07,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:57:07,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521516853] [2021-11-02 12:57:07,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:57:07,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:57:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:57:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:57:07,290 INFO L87 Difference]: Start difference. First operand 322 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:09,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:11,880 INFO L93 Difference]: Finished difference Result 543 states and 584 transitions. [2021-11-02 12:57:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:57:11,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:57:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:11,882 INFO L225 Difference]: With dead ends: 543 [2021-11-02 12:57:11,882 INFO L226 Difference]: Without dead ends: 372 [2021-11-02 12:57:11,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 351.21ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:57:11,883 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3820.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.97ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4332.08ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:11,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 532 Unknown, 0 Unchecked, 6.97ms Time], IncrementalHoareTripleChecker [7 Valid, 524 Invalid, 1 Unknown, 0 Unchecked, 4332.08ms Time] [2021-11-02 12:57:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-02 12:57:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 322. [2021-11-02 12:57:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 312 states have (on average 1.1121794871794872) internal successors, (347), 321 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 347 transitions. [2021-11-02 12:57:11,912 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 347 transitions. Word has length 51 [2021-11-02 12:57:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:11,912 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 347 transitions. [2021-11-02 12:57:11,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 347 transitions. [2021-11-02 12:57:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:57:11,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:11,913 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] [2021-11-02 12:57:11,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-02 12:57:11,914 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:57:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 580617946, now seen corresponding path program 1 times [2021-11-02 12:57:11,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:57:11,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927684615] [2021-11-02 12:57:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:11,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:57:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:57:12,267 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-02 12:57:12,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:57:12,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927684615] [2021-11-02 12:57:12,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927684615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:57:12,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:57:12,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:57:12,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219629824] [2021-11-02 12:57:12,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:57:12,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:57:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:57:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:57:12,268 INFO L87 Difference]: Start difference. First operand 322 states and 347 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:15,450 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:18,015 INFO L93 Difference]: Finished difference Result 350 states and 372 transitions. [2021-11-02 12:57:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:57:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-02 12:57:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:18,016 INFO L225 Difference]: With dead ends: 350 [2021-11-02 12:57:18,016 INFO L226 Difference]: Without dead ends: 348 [2021-11-02 12:57:18,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 180.23ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:57:18,017 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5116.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.64ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5628.99ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:18,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 667 Unknown, 0 Unchecked, 6.64ms Time], IncrementalHoareTripleChecker [2 Valid, 664 Invalid, 1 Unknown, 0 Unchecked, 5628.99ms Time] [2021-11-02 12:57:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-02 12:57:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 324. [2021-11-02 12:57:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 314 states have (on average 1.1114649681528663) internal successors, (349), 323 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 349 transitions. [2021-11-02 12:57:18,033 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 349 transitions. Word has length 53 [2021-11-02 12:57:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:18,033 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 349 transitions. [2021-11-02 12:57:18,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 349 transitions. [2021-11-02 12:57:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:57:18,034 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:18,034 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] [2021-11-02 12:57:18,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 12:57:18,047 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:57:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 677957058, now seen corresponding path program 1 times [2021-11-02 12:57:18,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:57:18,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859457174] [2021-11-02 12:57:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:18,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:57:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:57:19,285 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-02 12:57:19,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:57:19,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859457174] [2021-11-02 12:57:19,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859457174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:57:19,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:57:19,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:57:19,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208418012] [2021-11-02 12:57:19,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:57:19,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:57:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:57:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:57:19,288 INFO L87 Difference]: Start difference. First operand 324 states and 349 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:22,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:27,029 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2021-11-02 12:57:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 12:57:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-02 12:57:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:27,030 INFO L225 Difference]: With dead ends: 382 [2021-11-02 12:57:27,030 INFO L226 Difference]: Without dead ends: 355 [2021-11-02 12:57:27,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1308.24ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:57:27,031 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6294.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.73ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6900.15ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:27,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 1000 Unknown, 0 Unchecked, 12.73ms Time], IncrementalHoareTripleChecker [19 Valid, 980 Invalid, 1 Unknown, 0 Unchecked, 6900.15ms Time] [2021-11-02 12:57:27,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-11-02 12:57:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 320. [2021-11-02 12:57:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 310 states have (on average 1.1096774193548387) internal successors, (344), 319 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 344 transitions. [2021-11-02 12:57:27,068 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 344 transitions. Word has length 53 [2021-11-02 12:57:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:27,068 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 344 transitions. [2021-11-02 12:57:27,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 344 transitions. [2021-11-02 12:57:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:57:27,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:27,069 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] [2021-11-02 12:57:27,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-02 12:57:27,069 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:57:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1379556932, now seen corresponding path program 1 times [2021-11-02 12:57:27,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:57:27,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144505867] [2021-11-02 12:57:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:27,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:57:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:57:28,057 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-02 12:57:28,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:57:28,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144505867] [2021-11-02 12:57:28,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144505867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:57:28,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:57:28,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 12:57:28,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086666270] [2021-11-02 12:57:28,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:57:28,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:57:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:57:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:57:28,058 INFO L87 Difference]: Start difference. First operand 320 states and 344 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:31,117 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:37,915 INFO L93 Difference]: Finished difference Result 346 states and 369 transitions. [2021-11-02 12:57:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 12:57:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-02 12:57:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:37,917 INFO L225 Difference]: With dead ends: 346 [2021-11-02 12:57:37,917 INFO L226 Difference]: Without dead ends: 330 [2021-11-02 12:57:37,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1464.99ms TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-11-02 12:57:37,917 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8130.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.78ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8821.87ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:37,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1672 Unknown, 0 Unchecked, 19.78ms Time], IncrementalHoareTripleChecker [14 Valid, 1657 Invalid, 1 Unknown, 0 Unchecked, 8821.87ms Time] [2021-11-02 12:57:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-02 12:57:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 279. [2021-11-02 12:57:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 269 states have (on average 1.1152416356877324) internal successors, (300), 278 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 300 transitions. [2021-11-02 12:57:37,929 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 300 transitions. Word has length 53 [2021-11-02 12:57:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:37,930 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 300 transitions. [2021-11-02 12:57:37,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 300 transitions. [2021-11-02 12:57:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:57:37,930 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:37,931 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] [2021-11-02 12:57:37,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-02 12:57:37,931 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:57:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1402189186, now seen corresponding path program 1 times [2021-11-02 12:57:37,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:57:37,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437030073] [2021-11-02 12:57:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:37,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:57:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:57:38,908 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-02 12:57:38,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:57:38,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437030073] [2021-11-02 12:57:38,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437030073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:57:38,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:57:38,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 12:57:38,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995622530] [2021-11-02 12:57:38,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:57:38,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:57:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:57:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:57:38,910 INFO L87 Difference]: Start difference. First operand 279 states and 300 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:42,141 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:46,318 INFO L93 Difference]: Finished difference Result 302 states and 320 transitions. [2021-11-02 12:57:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:57:46,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-02 12:57:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:46,320 INFO L225 Difference]: With dead ends: 302 [2021-11-02 12:57:46,320 INFO L226 Difference]: Without dead ends: 300 [2021-11-02 12:57:46,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 842.89ms TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:57:46,320 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 428 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6322.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.89ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6923.29ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:46,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 0 Invalid, 1058 Unknown, 0 Unchecked, 13.89ms Time], IncrementalHoareTripleChecker [12 Valid, 1045 Invalid, 1 Unknown, 0 Unchecked, 6923.29ms Time] [2021-11-02 12:57:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-02 12:57:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2021-11-02 12:57:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 272 states have (on average 1.1176470588235294) internal successors, (304), 281 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 304 transitions. [2021-11-02 12:57:46,331 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 304 transitions. Word has length 53 [2021-11-02 12:57:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:46,332 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 304 transitions. [2021-11-02 12:57:46,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 304 transitions. [2021-11-02 12:57:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 12:57:46,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:46,332 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] [2021-11-02 12:57:46,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-02 12:57:46,332 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:57:46,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -928229713, now seen corresponding path program 1 times [2021-11-02 12:57:46,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:57:46,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251278997] [2021-11-02 12:57:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:46,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:57:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:57:49,947 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-02 12:57:49,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:57:49,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251278997] [2021-11-02 12:57:49,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251278997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:57:49,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:57:49,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 12:57:49,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275145864] [2021-11-02 12:57:49,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 12:57:49,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:57:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 12:57:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:57:49,948 INFO L87 Difference]: Start difference. First operand 282 states and 304 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:57:52,992 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:58:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:58:04,526 INFO L93 Difference]: Finished difference Result 468 states and 495 transitions. [2021-11-02 12:58:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-02 12:58:04,526 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-11-02 12:58:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:58:04,527 INFO L225 Difference]: With dead ends: 468 [2021-11-02 12:58:04,528 INFO L226 Difference]: Without dead ends: 418 [2021-11-02 12:58:04,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 3900.01ms TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2021-11-02 12:58:04,528 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 608 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10551.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.29ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11385.94ms IncrementalHoareTripleChecker+Time [2021-11-02 12:58:04,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 0 Invalid, 2562 Unknown, 0 Unchecked, 30.29ms Time], IncrementalHoareTripleChecker [41 Valid, 2520 Invalid, 1 Unknown, 0 Unchecked, 11385.94ms Time] [2021-11-02 12:58:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-11-02 12:58:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 282. [2021-11-02 12:58:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 272 states have (on average 1.1139705882352942) internal successors, (303), 281 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 303 transitions. [2021-11-02 12:58:04,540 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 303 transitions. Word has length 54 [2021-11-02 12:58:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:58:04,540 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 303 transitions. [2021-11-02 12:58:04,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 303 transitions. [2021-11-02 12:58:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 12:58:04,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:58:04,541 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] [2021-11-02 12:58:04,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-02 12:58:04,542 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:58:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:58:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -248171343, now seen corresponding path program 1 times [2021-11-02 12:58:04,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:58:04,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783659890] [2021-11-02 12:58:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:58:04,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:58:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:58:05,512 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-02 12:58:05,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:58:05,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783659890] [2021-11-02 12:58:05,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783659890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:58:05,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:58:05,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 12:58:05,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146834927] [2021-11-02 12:58:05,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:58:05,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:58:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:58:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:58:05,515 INFO L87 Difference]: Start difference. First operand 282 states and 303 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:08,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:58:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:58:18,168 INFO L93 Difference]: Finished difference Result 465 states and 491 transitions. [2021-11-02 12:58:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 12:58:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-11-02 12:58:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:58:18,169 INFO L225 Difference]: With dead ends: 465 [2021-11-02 12:58:18,170 INFO L226 Difference]: Without dead ends: 413 [2021-11-02 12:58:18,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2049.98ms TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2021-11-02 12:58:18,170 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10212.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.71ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11021.97ms IncrementalHoareTripleChecker+Time [2021-11-02 12:58:18,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 2290 Unknown, 0 Unchecked, 23.71ms Time], IncrementalHoareTripleChecker [23 Valid, 2266 Invalid, 1 Unknown, 0 Unchecked, 11021.97ms Time] [2021-11-02 12:58:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-02 12:58:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 280. [2021-11-02 12:58:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 270 states have (on average 1.1111111111111112) internal successors, (300), 279 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 300 transitions. [2021-11-02 12:58:18,181 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 300 transitions. Word has length 54 [2021-11-02 12:58:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:58:18,182 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 300 transitions. [2021-11-02 12:58:18,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 300 transitions. [2021-11-02 12:58:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 12:58:18,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:58:18,182 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] [2021-11-02 12:58:18,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-02 12:58:18,182 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:58:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:58:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1768814319, now seen corresponding path program 1 times [2021-11-02 12:58:18,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:58:18,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664729206] [2021-11-02 12:58:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:58:18,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:58:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:58:21,917 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-02 12:58:21,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:58:21,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664729206] [2021-11-02 12:58:21,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664729206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:58:21,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:58:21,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 12:58:21,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296569240] [2021-11-02 12:58:21,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 12:58:21,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:58:21,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 12:58:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:58:21,919 INFO L87 Difference]: Start difference. First operand 280 states and 300 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:23,974 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:58:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:58:32,805 INFO L93 Difference]: Finished difference Result 478 states and 504 transitions. [2021-11-02 12:58:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 12:58:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-11-02 12:58:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:58:32,807 INFO L225 Difference]: With dead ends: 478 [2021-11-02 12:58:32,807 INFO L226 Difference]: Without dead ends: 394 [2021-11-02 12:58:32,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3290.14ms TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2021-11-02 12:58:32,808 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 378 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7565.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.95ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8368.31ms IncrementalHoareTripleChecker+Time [2021-11-02 12:58:32,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 0 Invalid, 1972 Unknown, 0 Unchecked, 22.95ms Time], IncrementalHoareTripleChecker [55 Valid, 1916 Invalid, 1 Unknown, 0 Unchecked, 8368.31ms Time] [2021-11-02 12:58:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-02 12:58:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2021-11-02 12:58:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 279 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 299 transitions. [2021-11-02 12:58:32,840 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 299 transitions. Word has length 54 [2021-11-02 12:58:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:58:32,841 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 299 transitions. [2021-11-02 12:58:32,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 299 transitions. [2021-11-02 12:58:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 12:58:32,841 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:58:32,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] [2021-11-02 12:58:32,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-02 12:58:32,842 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:58:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:58:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1846094607, now seen corresponding path program 1 times [2021-11-02 12:58:32,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:58:32,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983019263] [2021-11-02 12:58:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:58:32,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:58:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:58:35,312 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-02 12:58:35,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:58:35,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983019263] [2021-11-02 12:58:35,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983019263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:58:35,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:58:35,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:58:35,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213619262] [2021-11-02 12:58:35,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:58:35,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:58:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:58:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:58:35,314 INFO L87 Difference]: Start difference. First operand 280 states and 299 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:37,878 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:58:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:58:44,201 INFO L93 Difference]: Finished difference Result 444 states and 467 transitions. [2021-11-02 12:58:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 12:58:44,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-11-02 12:58:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:58:44,203 INFO L225 Difference]: With dead ends: 444 [2021-11-02 12:58:44,203 INFO L226 Difference]: Without dead ends: 358 [2021-11-02 12:58:44,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1790.07ms TimeCoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2021-11-02 12:58:44,204 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 414 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6914.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.91ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7480.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:58:44,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 0 Invalid, 1565 Unknown, 0 Unchecked, 15.91ms Time], IncrementalHoareTripleChecker [45 Valid, 1519 Invalid, 1 Unknown, 0 Unchecked, 7480.34ms Time] [2021-11-02 12:58:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-02 12:58:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 278. [2021-11-02 12:58:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 277 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 296 transitions. [2021-11-02 12:58:44,216 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 296 transitions. Word has length 54 [2021-11-02 12:58:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:58:44,217 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 296 transitions. [2021-11-02 12:58:44,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 296 transitions. [2021-11-02 12:58:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-02 12:58:44,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:58:44,218 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] [2021-11-02 12:58:44,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-02 12:58:44,218 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:58:44,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:58:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1115787996, now seen corresponding path program 1 times [2021-11-02 12:58:44,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:58:44,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449708019] [2021-11-02 12:58:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:58:44,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:58:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:58:48,116 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-02 12:58:48,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:58:48,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449708019] [2021-11-02 12:58:48,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449708019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:58:48,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:58:48,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 12:58:48,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318507980] [2021-11-02 12:58:48,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 12:58:48,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:58:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 12:58:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-02 12:58:48,118 INFO L87 Difference]: Start difference. First operand 278 states and 296 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:51,311 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:58:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:58:57,281 INFO L93 Difference]: Finished difference Result 288 states and 305 transitions. [2021-11-02 12:58:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:58:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-11-02 12:58:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:58:57,282 INFO L225 Difference]: With dead ends: 288 [2021-11-02 12:58:57,283 INFO L226 Difference]: Without dead ends: 286 [2021-11-02 12:58:57,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1894.99ms TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:58:57,283 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 220 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7698.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.99ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8401.36ms IncrementalHoareTripleChecker+Time [2021-11-02 12:58:57,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 0 Invalid, 1440 Unknown, 0 Unchecked, 16.99ms Time], IncrementalHoareTripleChecker [25 Valid, 1414 Invalid, 1 Unknown, 0 Unchecked, 8401.36ms Time] [2021-11-02 12:58:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-11-02 12:58:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2021-11-02 12:58:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 272 states have (on average 1.1029411764705883) internal successors, (300), 281 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 300 transitions. [2021-11-02 12:58:57,296 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 300 transitions. Word has length 55 [2021-11-02 12:58:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:58:57,296 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 300 transitions. [2021-11-02 12:58:57,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:58:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 300 transitions. [2021-11-02 12:58:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 12:58:57,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:58:57,297 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] [2021-11-02 12:58:57,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-02 12:58:57,297 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:58:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:58:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1632186344, now seen corresponding path program 1 times [2021-11-02 12:58:57,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:58:57,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600525633] [2021-11-02 12:58:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:58:57,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:58:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:58:58,095 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-02 12:58:58,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:58:58,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600525633] [2021-11-02 12:58:58,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600525633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:58:58,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:58:58,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 12:58:58,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409898236] [2021-11-02 12:58:58,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 12:58:58,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:58:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 12:58:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:58:58,097 INFO L87 Difference]: Start difference. First operand 282 states and 300 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:59:01,414 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:59:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:59:07,817 INFO L93 Difference]: Finished difference Result 380 states and 401 transitions. [2021-11-02 12:59:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 12:59:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-11-02 12:59:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:59:07,818 INFO L225 Difference]: With dead ends: 380 [2021-11-02 12:59:07,819 INFO L226 Difference]: Without dead ends: 374 [2021-11-02 12:59:07,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1739.31ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-02 12:59:07,819 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 127 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7655.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.43ms SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8320.77ms IncrementalHoareTripleChecker+Time [2021-11-02 12:59:07,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1541 Unknown, 0 Unchecked, 15.43ms Time], IncrementalHoareTripleChecker [127 Valid, 1413 Invalid, 1 Unknown, 0 Unchecked, 8320.77ms Time] [2021-11-02 12:59:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-02 12:59:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 278. [2021-11-02 12:59:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 269 states have (on average 1.096654275092937) internal successors, (295), 277 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:59:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 295 transitions. [2021-11-02 12:59:07,834 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 295 transitions. Word has length 56 [2021-11-02 12:59:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:59:07,834 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 295 transitions. [2021-11-02 12:59:07,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:59:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 295 transitions. [2021-11-02 12:59:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-02 12:59:07,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:59:07,835 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-02 12:59:07,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-02 12:59:07,836 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:59:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:59:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash -787246305, now seen corresponding path program 1 times [2021-11-02 12:59:07,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:59:07,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226657977] [2021-11-02 12:59:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:59:07,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:59:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:59:08,578 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-02 12:59:08,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:59:08,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226657977] [2021-11-02 12:59:08,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226657977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:59:08,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:59:08,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:59:08,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765115800] [2021-11-02 12:59:08,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:59:08,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:59:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:59:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:59:08,579 INFO L87 Difference]: Start difference. First operand 278 states and 295 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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-02 12:59:11,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:59:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:59:15,222 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2021-11-02 12:59:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:59:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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-02 12:59:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:59:15,224 INFO L225 Difference]: With dead ends: 288 [2021-11-02 12:59:15,224 INFO L226 Difference]: Without dead ends: 229 [2021-11-02 12:59:15,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 891.28ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:59:15,225 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5504.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.37ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6054.63ms IncrementalHoareTripleChecker+Time [2021-11-02 12:59:15,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 795 Unknown, 0 Unchecked, 8.37ms Time], IncrementalHoareTripleChecker [16 Valid, 778 Invalid, 1 Unknown, 0 Unchecked, 6054.63ms Time] [2021-11-02 12:59:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-02 12:59:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-11-02 12:59:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 220 states have (on average 1.1090909090909091) internal successors, (244), 228 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:59:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2021-11-02 12:59:15,235 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 57 [2021-11-02 12:59:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:59:15,236 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2021-11-02 12:59:15,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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-02 12:59:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2021-11-02 12:59:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-02 12:59:15,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:59:15,237 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-02 12:59:15,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-02 12:59:15,237 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:59:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:59:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1469695334, now seen corresponding path program 1 times [2021-11-02 12:59:15,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:59:15,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447736739] [2021-11-02 12:59:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:59:15,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:59:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:59:19,873 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-02 12:59:19,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:59:19,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447736739] [2021-11-02 12:59:19,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447736739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:59:19,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:59:19,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-02 12:59:19,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070419025] [2021-11-02 12:59:19,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-02 12:59:19,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:59:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-02 12:59:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2021-11-02 12:59:19,874 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-02 12:59:21,923 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:59:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:59:33,996 INFO L93 Difference]: Finished difference Result 233 states and 247 transitions. [2021-11-02 12:59:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 12:59:33,997 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-02 12:59:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:59:33,998 INFO L225 Difference]: With dead ends: 233 [2021-11-02 12:59:33,998 INFO L226 Difference]: Without dead ends: 179 [2021-11-02 12:59:33,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 8182.67ms TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2021-11-02 12:59:33,999 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7139.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.08ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7769.69ms IncrementalHoareTripleChecker+Time [2021-11-02 12:59:33,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 1700 Unknown, 0 Unchecked, 21.08ms Time], IncrementalHoareTripleChecker [74 Valid, 1625 Invalid, 1 Unknown, 0 Unchecked, 7769.69ms Time] [2021-11-02 12:59:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-02 12:59:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-11-02 12:59:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 170 states have (on average 1.1294117647058823) internal successors, (192), 178 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:59:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 192 transitions. [2021-11-02 12:59:34,006 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 192 transitions. Word has length 57 [2021-11-02 12:59:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:59:34,006 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 192 transitions. [2021-11-02 12:59:34,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 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-02 12:59:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 192 transitions. [2021-11-02 12:59:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 12:59:34,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:59:34,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] [2021-11-02 12:59:34,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-02 12:59:34,008 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 12:59:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:59:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash -857306152, now seen corresponding path program 1 times [2021-11-02 12:59:34,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:59:34,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48326072] [2021-11-02 12:59:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:59:34,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:59:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:59:38,186 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-02 12:59:38,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:59:38,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48326072] [2021-11-02 12:59:38,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48326072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:59:38,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:59:38,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-02 12:59:38,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089756018] [2021-11-02 12:59:38,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 12:59:38,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:59:38,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 12:59:38,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:59:38,188 INFO L87 Difference]: Start difference. First operand 179 states and 192 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:59:41,309 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:00:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:00:06,449 INFO L93 Difference]: Finished difference Result 364 states and 389 transitions. [2021-11-02 13:00:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-02 13:00:06,450 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 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-02 13:00:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:00:06,450 INFO L225 Difference]: With dead ends: 364 [2021-11-02 13:00:06,450 INFO L226 Difference]: Without dead ends: 304 [2021-11-02 13:00:06,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 16904.50ms TimeCoverageRelationStatistics Valid=965, Invalid=3727, Unknown=0, NotChecked=0, Total=4692 [2021-11-02 13:00:06,452 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 598 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11942.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.26ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12826.24ms IncrementalHoareTripleChecker+Time [2021-11-02 13:00:06,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 0 Invalid, 2866 Unknown, 0 Unchecked, 34.26ms Time], IncrementalHoareTripleChecker [77 Valid, 2788 Invalid, 1 Unknown, 0 Unchecked, 12826.24ms Time] [2021-11-02 13:00:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-02 13:00:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 179. [2021-11-02 13:00:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 170 states have (on average 1.1235294117647059) internal successors, (191), 178 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2021-11-02 13:00:06,460 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 191 transitions. Word has length 61 [2021-11-02 13:00:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:00:06,460 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 191 transitions. [2021-11-02 13:00:06,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 191 transitions. [2021-11-02 13:00:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 13:00:06,461 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:00:06,461 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-02 13:00:06,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-02 13:00:06,461 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:00:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:00:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -177247782, now seen corresponding path program 1 times [2021-11-02 13:00:06,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:00:06,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248039428] [2021-11-02 13:00:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:00:06,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:00:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:00:07,942 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-02 13:00:07,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:00:07,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248039428] [2021-11-02 13:00:07,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248039428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:00:07,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:00:07,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 13:00:07,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22345948] [2021-11-02 13:00:07,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:00:07,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:00:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:00:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:00:07,944 INFO L87 Difference]: Start difference. First operand 179 states and 191 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:11,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:00:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:00:25,126 INFO L93 Difference]: Finished difference Result 354 states and 377 transitions. [2021-11-02 13:00:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-02 13:00:25,127 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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-02 13:00:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:00:25,128 INFO L225 Difference]: With dead ends: 354 [2021-11-02 13:00:25,128 INFO L226 Difference]: Without dead ends: 292 [2021-11-02 13:00:25,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 8476.29ms TimeCoverageRelationStatistics Valid=564, Invalid=1788, Unknown=0, NotChecked=0, Total=2352 [2021-11-02 13:00:25,129 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 858 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 117 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8753.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.84ms SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9492.31ms IncrementalHoareTripleChecker+Time [2021-11-02 13:00:25,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 0 Invalid, 1673 Unknown, 0 Unchecked, 22.84ms Time], IncrementalHoareTripleChecker [117 Valid, 1555 Invalid, 1 Unknown, 0 Unchecked, 9492.31ms Time] [2021-11-02 13:00:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-02 13:00:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 187. [2021-11-02 13:00:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 178 states have (on average 1.1235955056179776) internal successors, (200), 186 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-11-02 13:00:25,139 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 61 [2021-11-02 13:00:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:00:25,140 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-11-02 13:00:25,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-11-02 13:00:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-02 13:00:25,140 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:00:25,141 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] [2021-11-02 13:00:25,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-02 13:00:25,141 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:00:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:00:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1265222263, now seen corresponding path program 1 times [2021-11-02 13:00:25,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:00:25,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324101253] [2021-11-02 13:00:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:00:25,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:00:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:00:27,928 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-02 13:00:27,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:00:27,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324101253] [2021-11-02 13:00:27,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324101253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:00:27,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:00:27,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 13:00:27,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130559138] [2021-11-02 13:00:27,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 13:00:27,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:00:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 13:00:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-02 13:00:27,930 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:31,324 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:00:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:00:37,422 INFO L93 Difference]: Finished difference Result 261 states and 278 transitions. [2021-11-02 13:00:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:00:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-02 13:00:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:00:37,423 INFO L225 Difference]: With dead ends: 261 [2021-11-02 13:00:37,423 INFO L226 Difference]: Without dead ends: 199 [2021-11-02 13:00:37,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2254.72ms TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-11-02 13:00:37,424 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 342 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7180.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.50ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7828.41ms IncrementalHoareTripleChecker+Time [2021-11-02 13:00:37,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 0 Invalid, 1064 Unknown, 0 Unchecked, 14.50ms Time], IncrementalHoareTripleChecker [34 Valid, 1029 Invalid, 1 Unknown, 0 Unchecked, 7828.41ms Time] [2021-11-02 13:00:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-02 13:00:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 170. [2021-11-02 13:00:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.117283950617284) internal successors, (181), 169 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2021-11-02 13:00:37,433 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 67 [2021-11-02 13:00:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:00:37,435 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2021-11-02 13:00:37,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2021-11-02 13:00:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 13:00:37,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:00:37,444 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-02 13:00:37,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-02 13:00:37,444 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:00:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:00:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 171837296, now seen corresponding path program 1 times [2021-11-02 13:00:37,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:00:37,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948392366] [2021-11-02 13:00:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:00:37,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:00:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:00:39,026 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-02 13:00:39,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:00:39,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948392366] [2021-11-02 13:00:39,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948392366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:00:39,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:00:39,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-02 13:00:39,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626596807] [2021-11-02 13:00:39,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 13:00:39,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:00:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 13:00:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:00:39,027 INFO L87 Difference]: Start difference. First operand 170 states and 181 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 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-02 13:00:42,242 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:00:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:00:50,289 INFO L93 Difference]: Finished difference Result 235 states and 243 transitions. [2021-11-02 13:00:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 13:00:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 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-02 13:00:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:00:50,291 INFO L225 Difference]: With dead ends: 235 [2021-11-02 13:00:50,291 INFO L226 Difference]: Without dead ends: 188 [2021-11-02 13:00:50,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2993.21ms TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2021-11-02 13:00:50,292 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8387.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.39ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9116.79ms IncrementalHoareTripleChecker+Time [2021-11-02 13:00:50,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 1681 Unknown, 0 Unchecked, 19.39ms Time], IncrementalHoareTripleChecker [50 Valid, 1630 Invalid, 1 Unknown, 0 Unchecked, 9116.79ms Time] [2021-11-02 13:00:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-02 13:00:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2021-11-02 13:00:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.1111111111111112) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:00:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2021-11-02 13:00:50,299 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 69 [2021-11-02 13:00:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:00:50,299 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2021-11-02 13:00:50,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 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-02 13:00:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2021-11-02 13:00:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 13:00:50,300 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:00:50,300 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-02 13:00:50,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-02 13:00:50,300 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:00:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:00:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1048466312, now seen corresponding path program 1 times [2021-11-02 13:00:50,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:00:50,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975026792] [2021-11-02 13:00:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:00:50,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:00:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:00:51,996 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-02 13:00:51,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:00:51,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975026792] [2021-11-02 13:00:51,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975026792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:00:51,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:00:51,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 13:00:51,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690913486] [2021-11-02 13:00:51,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 13:00:51,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:00:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 13:00:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:00:51,998 INFO L87 Difference]: Start difference. First operand 170 states and 180 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 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-02 13:00:55,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:01:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:01:01,581 INFO L93 Difference]: Finished difference Result 231 states and 242 transitions. [2021-11-02 13:01:01,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 13:01:01,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 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-02 13:01:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:01:01,583 INFO L225 Difference]: With dead ends: 231 [2021-11-02 13:01:01,583 INFO L226 Difference]: Without dead ends: 189 [2021-11-02 13:01:01,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3303.49ms TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2021-11-02 13:01:01,584 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 403 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6471.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.68ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7032.61ms IncrementalHoareTripleChecker+Time [2021-11-02 13:01:01,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 0 Invalid, 1114 Unknown, 0 Unchecked, 13.68ms Time], IncrementalHoareTripleChecker [49 Valid, 1064 Invalid, 1 Unknown, 0 Unchecked, 7032.61ms Time] [2021-11-02 13:01:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-02 13:01:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2021-11-02 13:01:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 169 states have (on average 1.106508875739645) internal successors, (187), 176 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2021-11-02 13:01:01,592 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 69 [2021-11-02 13:01:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:01:01,593 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2021-11-02 13:01:01,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 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-02 13:01:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2021-11-02 13:01:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:01:01,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:01:01,593 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] [2021-11-02 13:01:01,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-02 13:01:01,594 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:01:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:01:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -235238369, now seen corresponding path program 1 times [2021-11-02 13:01:01,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:01:01,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111155042] [2021-11-02 13:01:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:01:01,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:01:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:01:06,297 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-02 13:01:06,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:01:06,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111155042] [2021-11-02 13:01:06,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111155042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:01:06,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:01:06,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-02 13:01:06,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996144290] [2021-11-02 13:01:06,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-02 13:01:06,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:01:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-02 13:01:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-11-02 13:01:06,299 INFO L87 Difference]: Start difference. First operand 177 states and 187 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 21 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:09,682 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:01:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:01:18,882 INFO L93 Difference]: Finished difference Result 236 states and 246 transitions. [2021-11-02 13:01:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 13:01:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 21 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:01:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:01:18,884 INFO L225 Difference]: With dead ends: 236 [2021-11-02 13:01:18,884 INFO L226 Difference]: Without dead ends: 221 [2021-11-02 13:01:18,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 5840.00ms TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2021-11-02 13:01:18,884 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8354.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.00ms SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9097.71ms IncrementalHoareTripleChecker+Time [2021-11-02 13:01:18,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 1560 Unknown, 0 Unchecked, 18.00ms Time], IncrementalHoareTripleChecker [73 Valid, 1486 Invalid, 1 Unknown, 0 Unchecked, 9097.71ms Time] [2021-11-02 13:01:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-02 13:01:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2021-11-02 13:01:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.0954773869346734) internal successors, (218), 206 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 218 transitions. [2021-11-02 13:01:18,894 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 218 transitions. Word has length 75 [2021-11-02 13:01:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:01:18,894 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 218 transitions. [2021-11-02 13:01:18,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 21 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 218 transitions. [2021-11-02 13:01:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:01:18,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:01:18,895 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] [2021-11-02 13:01:18,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-02 13:01:18,895 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:01:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:01:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1079243871, now seen corresponding path program 1 times [2021-11-02 13:01:18,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:01:18,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559581211] [2021-11-02 13:01:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:01:18,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:01:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:01:21,016 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-02 13:01:21,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:01:21,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559581211] [2021-11-02 13:01:21,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559581211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:01:21,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:01:21,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-02 13:01:21,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134076109] [2021-11-02 13:01:21,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 13:01:21,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:01:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 13:01:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:01:21,018 INFO L87 Difference]: Start difference. First operand 207 states and 218 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:24,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:01:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:01:32,529 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2021-11-02 13:01:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:01:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:01:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:01:32,531 INFO L225 Difference]: With dead ends: 228 [2021-11-02 13:01:32,531 INFO L226 Difference]: Without dead ends: 226 [2021-11-02 13:01:32,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2721.60ms TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2021-11-02 13:01:32,531 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9122.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.99ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9877.81ms IncrementalHoareTripleChecker+Time [2021-11-02 13:01:32,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 2083 Unknown, 0 Unchecked, 23.99ms Time], IncrementalHoareTripleChecker [37 Valid, 2045 Invalid, 1 Unknown, 0 Unchecked, 9877.81ms Time] [2021-11-02 13:01:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-02 13:01:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2021-11-02 13:01:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.0904522613065326) internal successors, (217), 206 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 217 transitions. [2021-11-02 13:01:32,542 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 217 transitions. Word has length 75 [2021-11-02 13:01:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:01:32,542 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 217 transitions. [2021-11-02 13:01:32,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2021-11-02 13:01:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:01:32,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:01:32,546 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] [2021-11-02 13:01:32,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-02 13:01:32,547 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:01:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:01:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash 838259593, now seen corresponding path program 1 times [2021-11-02 13:01:32,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:01:32,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259356345] [2021-11-02 13:01:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:01:32,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:01:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:01:35,412 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-02 13:01:35,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:01:35,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259356345] [2021-11-02 13:01:35,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259356345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:01:35,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:01:35,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 13:01:35,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960521580] [2021-11-02 13:01:35,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 13:01:35,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:01:35,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 13:01:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:01:35,414 INFO L87 Difference]: Start difference. First operand 207 states and 217 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:38,791 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:01:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:01:43,556 INFO L93 Difference]: Finished difference Result 280 states and 290 transitions. [2021-11-02 13:01:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 13:01:43,557 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:01:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:01:43,558 INFO L225 Difference]: With dead ends: 280 [2021-11-02 13:01:43,558 INFO L226 Difference]: Without dead ends: 243 [2021-11-02 13:01:43,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1510.22ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-11-02 13:01:43,558 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6644.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.32ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7238.53ms IncrementalHoareTripleChecker+Time [2021-11-02 13:01:43,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 1092 Unknown, 0 Unchecked, 11.32ms Time], IncrementalHoareTripleChecker [9 Valid, 1082 Invalid, 1 Unknown, 0 Unchecked, 7238.53ms Time] [2021-11-02 13:01:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-02 13:01:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 207. [2021-11-02 13:01:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 199 states have (on average 1.085427135678392) internal successors, (216), 206 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 216 transitions. [2021-11-02 13:01:43,569 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 216 transitions. Word has length 75 [2021-11-02 13:01:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:01:43,569 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 216 transitions. [2021-11-02 13:01:43,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 216 transitions. [2021-11-02 13:01:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:01:43,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:01:43,570 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] [2021-11-02 13:01:43,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-02 13:01:43,570 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:01:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:01:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1518317963, now seen corresponding path program 1 times [2021-11-02 13:01:43,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:01:43,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233372516] [2021-11-02 13:01:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:01:43,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:01:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:01:44,087 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-02 13:01:44,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:01:44,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233372516] [2021-11-02 13:01:44,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233372516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:01:44,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:01:44,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:01:44,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894439235] [2021-11-02 13:01:44,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:01:44,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:01:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:01:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:01:44,089 INFO L87 Difference]: Start difference. First operand 207 states and 216 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:47,234 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:01:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:01:50,954 INFO L93 Difference]: Finished difference Result 271 states and 280 transitions. [2021-11-02 13:01:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 13:01:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:01:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:01:50,955 INFO L225 Difference]: With dead ends: 271 [2021-11-02 13:01:50,955 INFO L226 Difference]: Without dead ends: 232 [2021-11-02 13:01:50,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 444.77ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:01:50,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6054.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.97ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6622.99ms IncrementalHoareTripleChecker+Time [2021-11-02 13:01:50,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 955 Unknown, 0 Unchecked, 9.97ms Time], IncrementalHoareTripleChecker [8 Valid, 946 Invalid, 1 Unknown, 0 Unchecked, 6622.99ms Time] [2021-11-02 13:01:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-02 13:01:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 198. [2021-11-02 13:01:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 191 states have (on average 1.0785340314136125) internal successors, (206), 197 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2021-11-02 13:01:50,984 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 75 [2021-11-02 13:01:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:01:50,985 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2021-11-02 13:01:50,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2021-11-02 13:01:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:01:50,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:01:50,985 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] [2021-11-02 13:01:50,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-02 13:01:50,986 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:01:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:01:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash 667231289, now seen corresponding path program 1 times [2021-11-02 13:01:50,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:01:50,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493015842] [2021-11-02 13:01:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:01:50,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:01:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:01:51,544 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-02 13:01:51,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:01:51,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493015842] [2021-11-02 13:01:51,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493015842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:01:51,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:01:51,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:01:51,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544798171] [2021-11-02 13:01:51,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:01:51,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:01:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:01:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:01:51,545 INFO L87 Difference]: Start difference. First operand 198 states and 206 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:53,727 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:01:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:01:57,393 INFO L93 Difference]: Finished difference Result 266 states and 274 transitions. [2021-11-02 13:01:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:01:57,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:01:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:01:57,394 INFO L225 Difference]: With dead ends: 266 [2021-11-02 13:01:57,394 INFO L226 Difference]: Without dead ends: 232 [2021-11-02 13:01:57,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 553.43ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:01:57,395 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5086.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.88ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5520.13ms IncrementalHoareTripleChecker+Time [2021-11-02 13:01:57,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 949 Unknown, 0 Unchecked, 9.88ms Time], IncrementalHoareTripleChecker [8 Valid, 940 Invalid, 1 Unknown, 0 Unchecked, 5520.13ms Time] [2021-11-02 13:01:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-02 13:01:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 198. [2021-11-02 13:01:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 191 states have (on average 1.0732984293193717) internal successors, (205), 197 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 205 transitions. [2021-11-02 13:01:57,404 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 205 transitions. Word has length 75 [2021-11-02 13:01:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:01:57,404 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 205 transitions. [2021-11-02 13:01:57,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:01:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 205 transitions. [2021-11-02 13:01:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:01:57,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:01:57,405 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] [2021-11-02 13:01:57,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-02 13:01:57,406 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:01:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:01:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 971638839, now seen corresponding path program 1 times [2021-11-02 13:01:57,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:01:57,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353689907] [2021-11-02 13:01:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:01:57,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:01:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:02:01,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-02 13:02:01,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:02:01,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353689907] [2021-11-02 13:02:01,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353689907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:02:01,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:02:01,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-02 13:02:01,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710935723] [2021-11-02 13:02:01,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-02 13:02:01,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:02:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-02 13:02:01,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2021-11-02 13:02:01,444 INFO L87 Difference]: Start difference. First operand 198 states and 205 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:04,697 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:02:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:02:27,954 INFO L93 Difference]: Finished difference Result 257 states and 263 transitions. [2021-11-02 13:02:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-02 13:02:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:02:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:02:27,955 INFO L225 Difference]: With dead ends: 257 [2021-11-02 13:02:27,955 INFO L226 Difference]: Without dead ends: 243 [2021-11-02 13:02:27,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 16438.40ms TimeCoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2021-11-02 13:02:27,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 479 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11217.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.89ms SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12151.85ms IncrementalHoareTripleChecker+Time [2021-11-02 13:02:27,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 0 Invalid, 2364 Unknown, 0 Unchecked, 31.89ms Time], IncrementalHoareTripleChecker [67 Valid, 2296 Invalid, 1 Unknown, 0 Unchecked, 12151.85ms Time] [2021-11-02 13:02:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-02 13:02:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 204. [2021-11-02 13:02:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 197 states have (on average 1.0710659898477157) internal successors, (211), 203 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 211 transitions. [2021-11-02 13:02:27,968 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 211 transitions. Word has length 75 [2021-11-02 13:02:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:02:27,968 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 211 transitions. [2021-11-02 13:02:27,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 211 transitions. [2021-11-02 13:02:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:02:27,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:02:27,969 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] [2021-11-02 13:02:27,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-02 13:02:27,969 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:02:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:02:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 971698421, now seen corresponding path program 1 times [2021-11-02 13:02:27,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:02:27,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519495167] [2021-11-02 13:02:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:02:27,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:02:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:02:30,111 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-02 13:02:30,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:02:30,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519495167] [2021-11-02 13:02:30,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519495167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:02:30,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:02:30,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 13:02:30,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147746203] [2021-11-02 13:02:30,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 13:02:30,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:02:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 13:02:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:02:30,113 INFO L87 Difference]: Start difference. First operand 204 states and 211 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:33,401 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:02:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:02:40,987 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2021-11-02 13:02:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:02:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:02:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:02:40,988 INFO L225 Difference]: With dead ends: 231 [2021-11-02 13:02:40,988 INFO L226 Difference]: Without dead ends: 218 [2021-11-02 13:02:40,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2329.27ms TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-11-02 13:02:40,989 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8631.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.49ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9362.23ms IncrementalHoareTripleChecker+Time [2021-11-02 13:02:40,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 1684 Unknown, 0 Unchecked, 21.49ms Time], IncrementalHoareTripleChecker [34 Valid, 1649 Invalid, 1 Unknown, 0 Unchecked, 9362.23ms Time] [2021-11-02 13:02:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-02 13:02:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 204. [2021-11-02 13:02:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 197 states have (on average 1.0659898477157361) internal successors, (210), 203 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 210 transitions. [2021-11-02 13:02:41,000 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 210 transitions. Word has length 75 [2021-11-02 13:02:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:02:41,001 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 210 transitions. [2021-11-02 13:02:41,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 210 transitions. [2021-11-02 13:02:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-02 13:02:41,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:02:41,002 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] [2021-11-02 13:02:41,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-02 13:02:41,002 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:02:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:02:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 971740127, now seen corresponding path program 1 times [2021-11-02 13:02:41,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:02:41,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612851271] [2021-11-02 13:02:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:02:41,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:02:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:02:47,662 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-02 13:02:47,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:02:47,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612851271] [2021-11-02 13:02:47,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612851271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:02:47,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:02:47,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-02 13:02:47,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352464110] [2021-11-02 13:02:47,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-02 13:02:47,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:02:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-02 13:02:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-11-02 13:02:47,663 INFO L87 Difference]: Start difference. First operand 204 states and 210 transitions. Second operand has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:02:51,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:03:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:03:05,136 INFO L93 Difference]: Finished difference Result 218 states and 223 transitions. [2021-11-02 13:03:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-02 13:03:05,136 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-02 13:03:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:03:05,137 INFO L225 Difference]: With dead ends: 218 [2021-11-02 13:03:05,137 INFO L226 Difference]: Without dead ends: 216 [2021-11-02 13:03:05,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 6488.70ms TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2021-11-02 13:03:05,138 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 293 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12278.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 33.75ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13262.98ms IncrementalHoareTripleChecker+Time [2021-11-02 13:03:05,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 0 Invalid, 2778 Unknown, 0 Unchecked, 33.75ms Time], IncrementalHoareTripleChecker [41 Valid, 2736 Invalid, 1 Unknown, 0 Unchecked, 13262.98ms Time] [2021-11-02 13:03:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-02 13:03:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 206. [2021-11-02 13:03:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 199 states have (on average 1.065326633165829) internal successors, (212), 205 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:03:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 212 transitions. [2021-11-02 13:03:05,149 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 212 transitions. Word has length 75 [2021-11-02 13:03:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:03:05,150 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 212 transitions. [2021-11-02 13:03:05,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:03:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 212 transitions. [2021-11-02 13:03:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-02 13:03:05,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:03:05,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] [2021-11-02 13:03:05,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-02 13:03:05,151 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:03:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:03:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2066106781, now seen corresponding path program 1 times [2021-11-02 13:03:05,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:03:05,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784033771] [2021-11-02 13:03:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:03:05,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:03:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:03:06,807 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-02 13:03:06,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:03:06,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784033771] [2021-11-02 13:03:06,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784033771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:03:06,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:03:06,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 13:03:06,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351414219] [2021-11-02 13:03:06,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 13:03:06,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:03:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 13:03:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:03:06,808 INFO L87 Difference]: Start difference. First operand 206 states and 212 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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-02 13:03:10,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:03:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:03:17,359 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2021-11-02 13:03:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 13:03:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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-02 13:03:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:03:17,360 INFO L225 Difference]: With dead ends: 225 [2021-11-02 13:03:17,360 INFO L226 Difference]: Without dead ends: 212 [2021-11-02 13:03:17,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1876.46ms TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-11-02 13:03:17,361 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8599.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.54ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9339.18ms IncrementalHoareTripleChecker+Time [2021-11-02 13:03:17,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 1682 Unknown, 0 Unchecked, 20.54ms Time], IncrementalHoareTripleChecker [34 Valid, 1647 Invalid, 1 Unknown, 0 Unchecked, 9339.18ms Time] [2021-11-02 13:03:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-02 13:03:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 170. [2021-11-02 13:03:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 164 states have (on average 1.0609756097560976) internal successors, (174), 169 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:03:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2021-11-02 13:03:17,372 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 77 [2021-11-02 13:03:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:03:17,372 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2021-11-02 13:03:17,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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-02 13:03:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2021-11-02 13:03:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-02 13:03:17,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:03:17,373 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-02 13:03:17,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-02 13:03:17,373 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:03:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:03:17,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2012017411, now seen corresponding path program 1 times [2021-11-02 13:03:17,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:03:17,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688624557] [2021-11-02 13:03:17,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:03:17,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:03:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:03:22,234 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-02 13:03:22,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:03:22,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688624557] [2021-11-02 13:03:22,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688624557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:03:22,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:03:22,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-02 13:03:22,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041814752] [2021-11-02 13:03:22,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-02 13:03:22,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:03:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-02 13:03:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-11-02 13:03:22,235 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 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-02 13:03:24,294 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:03:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:03:39,923 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2021-11-02 13:03:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-02 13:03:39,923 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 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-02 13:03:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:03:39,924 INFO L225 Difference]: With dead ends: 180 [2021-11-02 13:03:39,924 INFO L226 Difference]: Without dead ends: 178 [2021-11-02 13:03:39,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 10925.17ms TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2021-11-02 13:03:39,925 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 456 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7788.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.68ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8468.60ms IncrementalHoareTripleChecker+Time [2021-11-02 13:03:39,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 0 Invalid, 1697 Unknown, 0 Unchecked, 22.68ms Time], IncrementalHoareTripleChecker [39 Valid, 1657 Invalid, 1 Unknown, 0 Unchecked, 8468.60ms Time] [2021-11-02 13:03:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-02 13:03:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2021-11-02 13:03:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 168 states have (on average 1.0595238095238095) internal successors, (178), 173 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:03:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 178 transitions. [2021-11-02 13:03:39,934 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 178 transitions. Word has length 79 [2021-11-02 13:03:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:03:39,935 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 178 transitions. [2021-11-02 13:03:39,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 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-02 13:03:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2021-11-02 13:03:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:03:39,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:03:39,935 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] [2021-11-02 13:03:39,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-02 13:03:39,936 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:03:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:03:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash 711781694, now seen corresponding path program 1 times [2021-11-02 13:03:39,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:03:39,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891246704] [2021-11-02 13:03:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:03:39,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:03:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:03:47,911 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-02 13:03:47,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:03:47,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891246704] [2021-11-02 13:03:47,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891246704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:03:47,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:03:47,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-02 13:03:47,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986846708] [2021-11-02 13:03:47,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 13:03:47,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:03:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 13:03:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-02 13:03:47,912 INFO L87 Difference]: Start difference. First operand 174 states and 178 transitions. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:03:51,158 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:04:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:04:03,671 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2021-11-02 13:04:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 13:04:03,672 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:04:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:04:03,672 INFO L225 Difference]: With dead ends: 180 [2021-11-02 13:04:03,672 INFO L226 Difference]: Without dead ends: 139 [2021-11-02 13:04:03,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 9217.11ms TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2021-11-02 13:04:03,673 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7924.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.72ms SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8665.84ms IncrementalHoareTripleChecker+Time [2021-11-02 13:04:03,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 1466 Unknown, 0 Unchecked, 17.72ms Time], IncrementalHoareTripleChecker [44 Valid, 1421 Invalid, 1 Unknown, 0 Unchecked, 8665.84ms Time] [2021-11-02 13:04:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-02 13:04:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-11-02 13:04:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 133 states have (on average 1.0526315789473684) internal successors, (140), 138 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-02 13:04:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-11-02 13:04:03,708 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 81 [2021-11-02 13:04:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:04:03,709 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-11-02 13:04:03,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-11-02 13:04:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:04:03,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:04:03,709 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] [2021-11-02 13:04:03,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-02 13:04:03,710 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:04:03,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:04:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1067286314, now seen corresponding path program 1 times [2021-11-02 13:04:03,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:04:03,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237905828] [2021-11-02 13:04:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:04:03,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:04:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:04:09,763 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-02 13:04:09,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:04:09,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237905828] [2021-11-02 13:04:09,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237905828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:04:09,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:04:09,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-02 13:04:09,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258743532] [2021-11-02 13:04:09,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-02 13:04:09,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:04:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-02 13:04:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-11-02 13:04:09,764 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:11,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:04:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:04:25,742 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2021-11-02 13:04:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 13:04:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:04:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:04:25,743 INFO L225 Difference]: With dead ends: 193 [2021-11-02 13:04:25,743 INFO L226 Difference]: Without dead ends: 179 [2021-11-02 13:04:25,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 10653.52ms TimeCoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2021-11-02 13:04:25,744 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 532 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 79 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7705.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.95ms SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8332.11ms IncrementalHoareTripleChecker+Time [2021-11-02 13:04:25,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 0 Invalid, 1683 Unknown, 0 Unchecked, 23.95ms Time], IncrementalHoareTripleChecker [79 Valid, 1603 Invalid, 1 Unknown, 0 Unchecked, 8332.11ms Time] [2021-11-02 13:04:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-02 13:04:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2021-11-02 13:04:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 159 states have (on average 1.0440251572327044) internal successors, (166), 164 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2021-11-02 13:04:25,759 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 81 [2021-11-02 13:04:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:04:25,759 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2021-11-02 13:04:25,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2021-11-02 13:04:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:04:25,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:04:25,760 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] [2021-11-02 13:04:25,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-02 13:04:25,761 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:04:25,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:04:25,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1067387602, now seen corresponding path program 1 times [2021-11-02 13:04:25,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:04:25,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271109846] [2021-11-02 13:04:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:04:25,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:04:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:04:31,594 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-02 13:04:31,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:04:31,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271109846] [2021-11-02 13:04:31,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271109846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:04:31,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:04:31,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-02 13:04:31,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377474281] [2021-11-02 13:04:31,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-02 13:04:31,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:04:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-02 13:04:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-11-02 13:04:31,596 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:33,646 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:04:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:04:42,554 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2021-11-02 13:04:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 13:04:42,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:04:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:04:42,555 INFO L225 Difference]: With dead ends: 165 [2021-11-02 13:04:42,555 INFO L226 Difference]: Without dead ends: 163 [2021-11-02 13:04:42,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 5215.22ms TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2021-11-02 13:04:42,555 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6985.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.91ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7565.23ms IncrementalHoareTripleChecker+Time [2021-11-02 13:04:42,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 1560 Unknown, 0 Unchecked, 20.91ms Time], IncrementalHoareTripleChecker [35 Valid, 1524 Invalid, 1 Unknown, 0 Unchecked, 7565.23ms Time] [2021-11-02 13:04:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-02 13:04:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-11-02 13:04:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0379746835443038) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-11-02 13:04:42,565 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 81 [2021-11-02 13:04:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:04:42,566 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-11-02 13:04:42,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-11-02 13:04:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-02 13:04:42,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:04:42,567 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] [2021-11-02 13:04:42,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-02 13:04:42,567 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:04:42,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:04:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash 813584261, now seen corresponding path program 1 times [2021-11-02 13:04:42,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:04:42,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392303495] [2021-11-02 13:04:42,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:04:42,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:04:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:04:48,057 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-02 13:04:48,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:04:48,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392303495] [2021-11-02 13:04:48,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392303495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:04:48,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:04:48,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-02 13:04:48,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422287156] [2021-11-02 13:04:48,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-02 13:04:48,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:04:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-02 13:04:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-11-02 13:04:48,059 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:04:51,320 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:05:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:05:03,040 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2021-11-02 13:05:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 13:05:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-02 13:05:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:05:03,041 INFO L225 Difference]: With dead ends: 167 [2021-11-02 13:05:03,041 INFO L226 Difference]: Without dead ends: 143 [2021-11-02 13:05:03,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 7288.42ms TimeCoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2021-11-02 13:05:03,041 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8750.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.00ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9514.90ms IncrementalHoareTripleChecker+Time [2021-11-02 13:05:03,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 1678 Unknown, 0 Unchecked, 21.00ms Time], IncrementalHoareTripleChecker [49 Valid, 1628 Invalid, 1 Unknown, 0 Unchecked, 9514.90ms Time] [2021-11-02 13:05:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-02 13:05:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-02 13:05:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 142 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:05:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2021-11-02 13:05:03,049 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 81 [2021-11-02 13:05:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:05:03,050 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2021-11-02 13:05:03,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:05:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2021-11-02 13:05:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-02 13:05:03,050 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:05:03,050 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-02 13:05:03,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-02 13:05:03,050 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:05:03,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:05:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash -128599946, now seen corresponding path program 1 times [2021-11-02 13:05:03,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:05:03,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882086494] [2021-11-02 13:05:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:05:03,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:05:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:05:11,568 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-02 13:05:11,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:05:11,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882086494] [2021-11-02 13:05:11,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882086494] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:05:11,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:05:11,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-11-02 13:05:11,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467113297] [2021-11-02 13:05:11,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-02 13:05:11,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:05:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-02 13:05:11,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2021-11-02 13:05:11,570 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-02 13:05:13,625 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:05:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:05:28,036 INFO L93 Difference]: Finished difference Result 155 states and 154 transitions. [2021-11-02 13:05:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 13:05:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-02 13:05:28,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:05:28,037 INFO L225 Difference]: With dead ends: 155 [2021-11-02 13:05:28,037 INFO L226 Difference]: Without dead ends: 153 [2021-11-02 13:05:28,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 12283.13ms TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2021-11-02 13:05:28,038 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7961.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.82ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8604.79ms IncrementalHoareTripleChecker+Time [2021-11-02 13:05:28,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 1777 Unknown, 0 Unchecked, 20.82ms Time], IncrementalHoareTripleChecker [41 Valid, 1735 Invalid, 1 Unknown, 0 Unchecked, 8604.79ms Time] [2021-11-02 13:05:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-02 13:05:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2021-11-02 13:05:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0347222222222223) internal successors, (149), 148 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-02 13:05:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2021-11-02 13:05:28,046 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 85 [2021-11-02 13:05:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:05:28,046 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2021-11-02 13:05:28,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 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-02 13:05:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2021-11-02 13:05:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-02 13:05:28,047 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:05:28,047 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] [2021-11-02 13:05:28,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-02 13:05:28,047 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:05:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:05:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 969638968, now seen corresponding path program 1 times [2021-11-02 13:05:28,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:05:28,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185003439] [2021-11-02 13:05:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:05:28,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:05:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:05:33,063 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-02 13:05:33,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:05:33,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185003439] [2021-11-02 13:05:33,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185003439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:05:33,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:05:33,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-02 13:05:33,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272464103] [2021-11-02 13:05:33,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-02 13:05:33,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:05:33,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-02 13:05:33,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2021-11-02 13:05:33,064 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:05:36,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:05:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:05:49,058 INFO L93 Difference]: Finished difference Result 153 states and 152 transitions. [2021-11-02 13:05:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-02 13:05:49,058 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-02 13:05:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:05:49,059 INFO L225 Difference]: With dead ends: 153 [2021-11-02 13:05:49,059 INFO L226 Difference]: Without dead ends: 110 [2021-11-02 13:05:49,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 9398.99ms TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2021-11-02 13:05:49,060 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 303 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8694.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.87ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9448.55ms IncrementalHoareTripleChecker+Time [2021-11-02 13:05:49,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 0 Invalid, 1745 Unknown, 0 Unchecked, 21.87ms Time], IncrementalHoareTripleChecker [45 Valid, 1699 Invalid, 1 Unknown, 0 Unchecked, 9448.55ms Time] [2021-11-02 13:05:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-02 13:05:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-02 13:05:49,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 109 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-02 13:05:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 109 transitions. [2021-11-02 13:05:49,066 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 109 transitions. Word has length 87 [2021-11-02 13:05:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:05:49,066 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 109 transitions. [2021-11-02 13:05:49,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:05:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 109 transitions. [2021-11-02 13:05:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-02 13:05:49,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:05:49,066 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] [2021-11-02 13:05:49,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-02 13:05:49,066 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:05:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:05:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1632852647, now seen corresponding path program 1 times [2021-11-02 13:05:49,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:05:49,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005313575] [2021-11-02 13:05:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:05:49,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:05:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:05:53,119 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-02 13:05:53,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:05:53,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005313575] [2021-11-02 13:05:53,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005313575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:05:53,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:05:53,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 13:05:53,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803736399] [2021-11-02 13:05:53,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:05:53,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:05:53,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:05:53,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:05:53,120 INFO L87 Difference]: Start difference. First operand 110 states and 109 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:05:55,217 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:02,041 INFO L93 Difference]: Finished difference Result 110 states and 109 transitions. [2021-11-02 13:06:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 13:06:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-02 13:06:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:02,042 INFO L225 Difference]: With dead ends: 110 [2021-11-02 13:06:02,042 INFO L226 Difference]: Without dead ends: 96 [2021-11-02 13:06:02,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 6036.14ms TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2021-11-02 13:06:02,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 401 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4214.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.03ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4621.57ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:02,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 0 Invalid, 666 Unknown, 0 Unchecked, 10.03ms Time], IncrementalHoareTripleChecker [48 Valid, 617 Invalid, 1 Unknown, 0 Unchecked, 4621.57ms Time] [2021-11-02 13:06:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-02 13:06:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-11-02 13:06:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 95 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:06:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 95 transitions. [2021-11-02 13:06:02,048 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 95 transitions. Word has length 87 [2021-11-02 13:06:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:02,048 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 95 transitions. [2021-11-02 13:06:02,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:06:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 95 transitions. [2021-11-02 13:06:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-02 13:06:02,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:02,050 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-02 13:06:02,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-02 13:06:02,050 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:06:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1375219493, now seen corresponding path program 1 times [2021-11-02 13:06:02,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:02,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068175541] [2021-11-02 13:06:02,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:02,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:06:07,335 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-02 13:06:07,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:06:07,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068175541] [2021-11-02 13:06:07,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068175541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:06:07,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:06:07,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-02 13:06:07,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46241758] [2021-11-02 13:06:07,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:06:07,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:06:07,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:06:07,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:06:07,336 INFO L87 Difference]: Start difference. First operand 96 states and 95 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-02 13:06:10,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:15,711 INFO L93 Difference]: Finished difference Result 96 states and 95 transitions. [2021-11-02 13:06:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:06:15,711 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-02 13:06:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:15,712 INFO L225 Difference]: With dead ends: 96 [2021-11-02 13:06:15,712 INFO L226 Difference]: Without dead ends: 94 [2021-11-02 13:06:15,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3293.54ms TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2021-11-02 13:06:15,712 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6094.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.23ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6703.88ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:15,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 11.23ms Time], IncrementalHoareTripleChecker [19 Valid, 814 Invalid, 1 Unknown, 0 Unchecked, 6703.88ms Time] [2021-11-02 13:06:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-02 13:06:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-11-02 13:06:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.0) internal successors, (93), 93 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:06:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 93 transitions. [2021-11-02 13:06:15,718 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 93 transitions. Word has length 91 [2021-11-02 13:06:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:15,718 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 93 transitions. [2021-11-02 13:06:15,719 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-02 13:06:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 93 transitions. [2021-11-02 13:06:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-02 13:06:15,719 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:15,719 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] [2021-11-02 13:06:15,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-02 13:06:15,721 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-02 13:06:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1263858905, now seen corresponding path program 1 times [2021-11-02 13:06:15,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:15,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999336649] [2021-11-02 13:06:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:15,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:06:19,332 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-02 13:06:19,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:06:19,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999336649] [2021-11-02 13:06:19,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999336649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:06:19,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:06:19,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-02 13:06:19,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055012615] [2021-11-02 13:06:19,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 13:06:19,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:06:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 13:06:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-02 13:06:19,334 INFO L87 Difference]: Start difference. First operand 94 states and 93 transitions. Second operand has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:06:22,690 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:28,719 INFO L93 Difference]: Finished difference Result 94 states and 93 transitions. [2021-11-02 13:06:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 13:06:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2021-11-02 13:06:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:28,719 INFO L225 Difference]: With dead ends: 94 [2021-11-02 13:06:28,719 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 13:06:28,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3851.23ms TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2021-11-02 13:06:28,720 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6548.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.46ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7189.53ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:28,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 1024 Unknown, 0 Unchecked, 12.46ms Time], IncrementalHoareTripleChecker [38 Valid, 985 Invalid, 1 Unknown, 0 Unchecked, 7189.53ms Time] [2021-11-02 13:06:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 13:06:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 13:06:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:06:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 13:06:28,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2021-11-02 13:06:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:28,721 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 13:06:28,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 13:06:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 13:06:28,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 13:06:28,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2021-11-02 13:06:28,735 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2021-11-02 13:06:28,736 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2021-11-02 13:06:28,736 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2021-11-02 13:06:28,736 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2021-11-02 13:06:28,736 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 10 remaining) [2021-11-02 13:06:28,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (3 of 10 remaining) [2021-11-02 13:06:28,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2021-11-02 13:06:28,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2021-11-02 13:06:28,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2021-11-02 13:06:28,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-11-02 13:06:28,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 13:06:28,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:28,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:29,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:30,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:06:44,613 WARN L210 SmtUtils]: Spent 13.24s on a formula simplification. DAG size of input: 432 DAG size of output: 251 [2021-11-02 13:06:51,809 WARN L210 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 293 DAG size of output: 161 [2021-11-02 13:07:00,208 WARN L210 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 356 DAG size of output: 221 [2021-11-02 13:07:11,816 WARN L210 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 344 DAG size of output: 207 [2021-11-02 13:07:23,065 WARN L210 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 395 DAG size of output: 229 [2021-11-02 13:07:23,277 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,277 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 13:07:23,277 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,277 INFO L858 garLoopResultBuilder]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,277 INFO L854 garLoopResultBuilder]: At program point L7386-3(lines 7384 7388) the Hoare annotation is: (let ((.cse15 (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808)))) (let ((.cse9 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse13 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse14 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) 0)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0))) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse10 (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1)) (.cse11 (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) .cse15) (and (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)))) (.cse12 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0))) (or (let ((.cse8 (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8)) (.cse3 (+ .cse8 36028797018963967)) (.cse6 (select (select |#memory_int| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset))) (and .cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse1)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|)) .cse2 (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse1) 1) |#StackHeapBarrier|) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_bounded_malloc_~size .cse3)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< .cse3 ULTIMATE.start_bounded_malloc_~size))) .cse4 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (not (= |ULTIMATE.start_bounded_malloc_#res.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) .cse5 (<= .cse6 .cse3) .cse7 (<= .cse8 .cse6) .cse9 .cse10 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0)) (<= .cse6 9223372036854775807) .cse11 .cse12))) (and .cse13 .cse2 .cse4 (<= 0 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) .cse7 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 0) (not .cse14) .cse15 .cse9 .cse10 .cse12) (and .cse0 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12)))) [2021-11-02 13:07:23,277 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,278 INFO L858 garLoopResultBuilder]: For program point L7386-8(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,278 INFO L854 garLoopResultBuilder]: At program point L7386-7(lines 7384 7388) the Hoare annotation is: (let ((.cse33 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 8))) (let ((.cse31 (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (.cse20 (+ ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 8)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse33))) (let ((.cse2 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse4 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) 1)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse30 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) 0)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse8 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse29 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse13 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse16 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (.cse18 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse21 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse33)) (.cse32 (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1)) (.cse22 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) .cse20) .cse3)) (.cse23 (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) .cse31) (and (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)))) (.cse24 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0)) (.cse25 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base| 0))) (.cse26 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base 0))) (.cse27 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0)) (.cse28 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)))) (or (let ((.cse19 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse17 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8))) (let ((.cse12 (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616))) (.cse9 (select .cse19 .cse17)) (.cse11 (select (select |#memory_int| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse15 (+ .cse5 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse14 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset)))) (and .cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) .cse1 .cse2 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base| ULTIMATE.start_save_byte_from_array_~storage.base) (= ULTIMATE.start_save_byte_from_array_~array.offset .cse3) .cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset| 0) (<= 1 .cse5) .cse6 (= .cse3 0) (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) .cse8 (let ((.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|))) (= (select (select |#memory_int| .cse9) (select .cse10 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset|)) (select .cse10 8))) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset| 0) (<= .cse11 (+ .cse12 36028797018963967)) .cse13 (<= .cse14 .cse15) (<= .cse12 .cse11) (not (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|) 0)) .cse16 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse17) ULTIMATE.start_save_byte_from_array_~array.base) (not (= ULTIMATE.start_save_byte_from_array_~storage.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|)) .cse18 (= (select |#valid| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) 1) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|) (not (= (select .cse19 .cse20) 0)) (= .cse9 .cse21) .cse22 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0) (<= .cse11 9223372036854775807) (<= (+ ULTIMATE.start_save_byte_from_array_~array.base 1) |#StackHeapBarrier|) .cse23 .cse24 .cse25 (<= .cse15 .cse14) .cse26 .cse27 .cse28))) (and .cse2 .cse4 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) .cse6 (<= 0 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) .cse29 (<= 0 (+ 9223372036854775808 ULTIMATE.start_aws_byte_cursor_advance_~len)) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 0) (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (not .cse30) .cse31 .cse18 .cse32 .cse24 .cse26) (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 0) .cse6 .cse30 .cse7 (= ULTIMATE.start_save_byte_from_array_~size 0) .cse8 .cse29 .cse13 .cse16 .cse18 (= .cse5 0) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) .cse20) .cse21) .cse32 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28))))) [2021-11-02 13:07:23,278 INFO L858 garLoopResultBuilder]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,278 INFO L858 garLoopResultBuilder]: For program point L7386-12(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,278 INFO L854 garLoopResultBuilder]: At program point L7386-11(lines 7384 7388) the Hoare annotation is: (let ((.cse78 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 8)) (.cse69 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8))) (let ((.cse32 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse37 (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse77 (+ |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| 8)) (.cse62 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse69)) (.cse68 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse78))) (let ((.cse15 (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (.cse31 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807)) (.cse59 (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)) (.cse67 (+ ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 8)) (.cse56 (= .cse62 .cse68)) (.cse61 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse78)) (.cse57 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse69)) (.cse75 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base|) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset|)) (.cse65 (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse74 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse71 (div ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 18446744073709551616)) (.cse33 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse76 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base|) .cse77)) (.cse73 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base|) .cse77)) (.cse28 (= .cse37 1)) (.cse29 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))) (.cse41 (<= .cse32 (+ (* 18446744073709551616 (div .cse32 18446744073709551616)) 36028797018963967))) (.cse72 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset))) (let ((.cse1 (<= 0 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse22 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 0)) (.cse0 (= .cse72 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0))) (.cse11 (<= 0 (+ 9223372036854775808 ULTIMATE.start_aws_byte_cursor_advance_~len))) (.cse12 (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base))) (.cse14 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse18 (= .cse32 0)) (.cse20 (= (select |#valid| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) 1)) (.cse54 (or (not (= ULTIMATE.start_aws_byte_cursor_advance_~len 0)) (and (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len) .cse28 .cse29 (<= ULTIMATE.start_aws_byte_cursor_advance_~len ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse41))) (.cse8 (= .cse73 0)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| 0)) (.cse13 (= .cse76 0)) (.cse42 (<= 1 .cse33)) (.cse16 (<= (+ 1 .cse71) 0)) (.cse27 (not .cse74)) (.cse60 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset|)) (.cse40 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (.cse2 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse3 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse34 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse35 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset| 0)) (.cse30 (not .cse65)) (.cse36 (<= 0 .cse72)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse38 (not (= |ULTIMATE.start_bounded_malloc_#res.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|))) (.cse7 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse39 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse75)) (.cse9 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse43 (= .cse76 .cse68)) (.cse44 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse45 (<= 0 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse17 (= .cse75 0)) (.cse46 (or (and .cse56 .cse29 (= .cse61 0) (<= .cse57 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)) .cse74)) (.cse19 (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1)) (.cse47 (<= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset|)) (.cse48 (= .cse61 .cse73)) (.cse49 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse67) 0))) (.cse50 (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse73) .cse57)) (.cse51 (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) .cse15) (and .cse31 .cse59))) (.cse52 (< |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 1))) (.cse21 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0)) (.cse53 (< |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 1))) (.cse23 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base| 0))) (.cse24 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base 0))) (.cse25 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0)) (.cse26 (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| 0))) (.cse55 (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse72) .cse32))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse28 .cse29 .cse3 .cse30 .cse4 .cse5 .cse6 .cse31 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 (<= 1 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse2 .cse3 (<= .cse32 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse33)) .cse34 .cse35 .cse36 .cse4 (not (= .cse37 0)) .cse6 .cse38 .cse7 .cse39 .cse9 .cse40 .cse41 (not (= ULTIMATE.start_save_byte_from_array_~storage.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) .cse42 .cse14 .cse43 .cse44 .cse45 .cse46 .cse19 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse21 .cse53 .cse23 .cse54 .cse24 .cse26 .cse55) (let ((.cse58 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse61))) (and .cse0 .cse56 .cse2 .cse28 (<= .cse57 .cse58) .cse3 .cse30 .cse4 (<= .cse58 .cse57) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse40 .cse12 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 0) .cse59 .cse14 .cse15 .cse17 .cse43 .cse18 .cse20 .cse48 .cse52 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse60)) (let ((.cse66 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base))) (and (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= .cse57 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| .cse57) (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|)) (<= (+ .cse62 1) |#StackHeapBarrier|) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset| 0) (let ((.cse63 (or .cse65 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) .cse67) .cse61))) (.cse64 (or .cse65 (= (select .cse66 .cse67) .cse68)))) (or (and .cse2 .cse3 .cse34 .cse35 .cse30 .cse4 (<= (+ .cse32 1) ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse6 .cse38 .cse7 .cse8 .cse9 .cse10 .cse13 .cse42 .cse63 .cse17 .cse19 .cse49 .cse64 .cse51 .cse52 .cse23 .cse54 .cse24 .cse25 .cse26 .cse27 .cse60) (and .cse2 .cse3 .cse34 .cse35 .cse4 .cse6 .cse38 .cse7 .cse8 .cse9 .cse10 .cse13 .cse42 .cse63 .cse16 .cse17 .cse19 .cse49 .cse64 .cse51 .cse52 .cse23 .cse24 .cse25 .cse26 .cse27 .cse60))) .cse40 (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| (select .cse66 .cse69))) (let ((.cse70 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|))) (= (select .cse70 8) (select (select |#memory_int| .cse62) (select .cse70 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset|)))) .cse44 .cse21)) (and .cse2 .cse3 .cse34 .cse35 (<= .cse32 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse30 .cse36 .cse4 .cse6 .cse38 .cse7 .cse39 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse9 .cse43 .cse44 .cse45 (<= .cse32 (+ (* 18446744073709551616 .cse71) 36028797018963967)) (not .cse17) .cse46 .cse19 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse21 .cse53 .cse23 .cse24 .cse25 .cse26 .cse55)))))) [2021-11-02 13:07:23,278 INFO L858 garLoopResultBuilder]: For program point L7386-10(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,278 INFO L858 garLoopResultBuilder]: For program point L7386-16(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L854 garLoopResultBuilder]: At program point L7386-15(lines 7384 7388) the Hoare annotation is: (let ((.cse83 (+ |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| 8))) (let ((.cse79 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base|) .cse83)) (.cse56 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8)) (.cse81 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 8))) (let ((.cse65 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|)) (.cse59 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse81)) (.cse53 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse56)) (.cse80 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base|) .cse83)) (.cse52 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse56)) (.cse82 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse79)) (.cse21 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base|) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset|))) (let ((.cse24 (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (.cse44 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807)) (.cse66 (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)) (.cse47 (= .cse21 0)) (.cse10 (<= .cse52 .cse82)) (.cse25 (= .cse53 .cse80)) (.cse34 (<= .cse82 .cse52)) (.cse63 (= .cse53 .cse59)) (.cse43 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))) (.cse45 (= .cse79 0)) (.cse57 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset)) (.cse61 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse81)) (.cse27 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse65)) (.cse78 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse28 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse76 (div ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 18446744073709551616)) (.cse77 (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base)) (.cse68 (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse51 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base)) (.cse60 (+ ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 8))) (let ((.cse18 (select .cse51 .cse60)) (.cse1 (= .cse68 1)) (.cse23 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 0)) (.cse26 (= .cse80 .cse59)) (.cse42 (<= 0 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse54 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0))) (.cse12 (<= .cse21 0)) (.cse13 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse22 (not .cse77)) (.cse46 (= .cse80 0)) (.cse55 (<= (+ 1 .cse76) 0)) (.cse48 (= .cse28 0)) (.cse49 (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1)) (.cse50 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 0)) (.cse40 (not .cse78)) (.cse3 (<= .cse28 .cse27)) (.cse20 (<= .cse28 (+ (* 18446744073709551616 (div .cse28 18446744073709551616)) 36028797018963967))) (.cse29 (<= 0 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse33 (= .cse61 .cse79)) (.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse2 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse67 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset| 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))) (.cse7 (<= 0 .cse57)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse14 (not (= |ULTIMATE.start_bounded_malloc_#res.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|))) (.cse15 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse69 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse21)) (.cse16 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse17 (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| 0)) (.cse19 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (.cse70 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse71 (or (not .cse45) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0)))) (.cse72 (or .cse78 (and .cse63 .cse43 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse52) (= .cse61 0) (<= .cse52 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)))) (.cse73 (or .cse77 (and .cse10 .cse25 .cse34))) (.cse74 (not .cse47)) (.cse30 (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse31 (= (select |#valid| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) 1)) (.cse32 (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse62 (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) .cse24) (and .cse44 .cse66))) (.cse35 (< |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset| (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 1))) (.cse36 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0)) (.cse37 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base| 0))) (.cse38 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base 0))) (.cse39 (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| 0))) (.cse41 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset|)) (.cse75 (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse57) .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= .cse18 0)) .cse19 .cse20 (<= 0 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 (<= .cse27 .cse28) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0) .cse39 .cse40 .cse41) (and .cse42 .cse0 .cse1 .cse43 .cse2 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse44 .cse15 .cse45 .cse16 .cse17 .cse22 .cse46 .cse24 .cse47 .cse48 .cse30 .cse49 .cse31 .cse32 (<= 1 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse36 .cse50 .cse37 .cse38 .cse39 .cse40) (and (not (= (select .cse51 8) 0)) .cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= .cse52 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| .cse52) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse2 .cse4 (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|)) .cse5 .cse8 .cse9 (<= (+ .cse53 1) |#StackHeapBarrier|) .cse54 .cse11 .cse12 .cse13 .cse14 .cse15 .cse45 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset| 0) (or (and .cse1 .cse20) (not (= ULTIMATE.start_aws_byte_cursor_advance_~len 0))) .cse16 .cse19 (<= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0) (or (<= (+ .cse28 1) ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse55) (not (= |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.base| (select .cse51 .cse56))) (<= 1 .cse57) .cse46 (let ((.cse58 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|))) (= (select .cse58 8) (select (select |#memory_int| .cse53) (select .cse58 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset|)))) .cse24 (= .cse18 .cse59) .cse30 .cse49 .cse32 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) .cse60) .cse61) .cse62 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (let ((.cse64 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse61))) (and .cse63 .cse0 .cse1 .cse43 .cse2 (<= .cse52 .cse64) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset) .cse6 .cse8 .cse9 (= .cse65 0) (<= .cse64 .cse52) .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse22 .cse23 .cse66 .cse24 .cse47 .cse26 .cse48 .cse30 .cse49 (<= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6.offset|) .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41)) (and .cse42 .cse0 .cse2 .cse8 .cse9 .cse54 .cse11 .cse12 .cse13 .cse15 .cse45 .cse16 .cse17 .cse22 .cse46 .cse24 .cse55 .cse48 .cse30 .cse49 .cse31 .cse32 .cse62 .cse36 .cse50 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse2 .cse3 .cse4 .cse67 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= .cse68 0)) .cse14 .cse15 .cse69 .cse16 .cse17 .cse19 .cse20 (not (= ULTIMATE.start_save_byte_from_array_~storage.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) .cse70 .cse71 .cse72 .cse73 .cse29 .cse74 .cse30 .cse31 .cse32 .cse33 .cse62 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse75) (and .cse0 .cse2 .cse4 .cse67 .cse5 (<= .cse28 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse69 .cse16 .cse17 .cse19 .cse70 .cse71 .cse72 .cse73 (<= .cse28 (+ (* 18446744073709551616 .cse76) 36028797018963967)) .cse74 .cse30 .cse31 .cse32 .cse62 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse75))))))) [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7386-14(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L8295(lines 8295 8299) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L854 garLoopResultBuilder]: At program point L7386-19(lines 7384 7388) the Hoare annotation is: (let ((.cse83 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 8)) (.cse42 (select |#memory_int| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base))) (let ((.cse82 (+ 8 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset|)) (.cse27 (div ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 18446744073709551616)) (.cse56 (select .cse42 ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset)) (.cse78 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|)) (.cse11 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse74 (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse15 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse83)) (.cse84 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8))) (let ((.cse55 (select |#valid| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse84)) (.cse77 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse15)) (.cse33 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse84)) (.cse75 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse83)) (.cse4 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse60 (= .cse74 1)) (.cse61 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))) (.cse9 (<= ULTIMATE.start_aws_byte_cursor_advance_~len ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)) (.cse67 (<= .cse11 (+ (* 18446744073709551616 (div .cse11 18446744073709551616)) 36028797018963967))) (.cse54 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base)) (.cse81 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse78)) (.cse80 (not (= ULTIMATE.start_aws_byte_cursor_advance_~len 0))) (.cse52 (<= 1 .cse56)) (.cse26 (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (.cse38 (<= (+ 1 .cse27) 0)) (.cse62 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807)) (.cse69 (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)) (.cse79 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset|)) (.cse76 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base|) .cse82)) (.cse71 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base|) .cse82))) (let ((.cse57 (<= 0 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse43 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.offset| 0)) (.cse44 (= .cse71 0)) (.cse45 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.base| 0)) (.cse46 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) 0)) (.cse47 (= .cse76 0)) (.cse50 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.len| 0)) (.cse51 (= 0 .cse79)) (.cse59 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 0)) (.cse3 (or (and .cse26 .cse38) (and .cse62 .cse69))) (.cse6 (or .cse80 .cse52)) (.cse64 (<= .cse11 .cse81)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset| 0)) (.cse12 (<= 0 .cse56)) (.cse21 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset)) (.cse22 (not (= (select .cse54 (+ ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 8)) 0))) (.cse24 (<= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0)) (.cse70 (<= .cse81 .cse11)) (.cse41 (or .cse80 (and .cse4 .cse60 .cse61 .cse9 .cse67))) (.cse0 (= .cse33 .cse75)) (.cse1 (= .cse71 .cse15)) (.cse2 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.offset| .cse15)) (.cse34 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse72 (<= .cse8 .cse77)) (.cse7 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse79)) (.cse13 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse35 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse14 (= .cse78 0)) (.cse73 (<= .cse77 .cse8)) (.cse16 (= .cse76 .cse75)) (.cse17 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0))) (.cse18 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 |ULTIMATE.start_aws_byte_cursor_advance_#res.len|)) (.cse19 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse20 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse48 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse23 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (.cse25 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.base| .cse75)) (.cse68 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 0)) (.cse58 (= .cse11 0)) (.cse28 (= .cse55 1)) (.cse29 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0)) (.cse30 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base| 0))) (.cse31 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base 0))) (.cse63 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse8) .cse9 .cse10 (<= .cse11 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse12 .cse13 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse11) .cse14 (= .cse15 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse8 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse26 (<= .cse11 (+ (* 18446744073709551616 .cse27) 36028797018963967)) .cse28 .cse29 (< |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 1)) .cse30 .cse31) (and (= .cse8 0) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset| 0) .cse23 (let ((.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|))) (= (select .cse32 8) (select (select |#memory_int| .cse33) (select .cse32 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset|)))) (let ((.cse53 (= .cse56 0))) (let ((.cse36 (not .cse53)) (.cse37 (not (= .cse55 0))) (.cse39 (let ((.cse49 (or .cse53 (not (= (select .cse54 8) 0)) (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) 8) 0))))) (or (and .cse2 .cse3 (= (select .cse42 0) 0) .cse43 .cse13 .cse44 .cse45 .cse46 .cse17 .cse19 .cse20 .cse47 .cse48 .cse49 .cse26 .cse50 .cse51 .cse30 .cse31) (and .cse2 .cse3 .cse43 .cse13 .cse44 .cse45 .cse46 .cse17 .cse19 .cse20 .cse47 .cse48 .cse52 .cse49 .cse26 .cse50 .cse51 .cse30 .cse31)))) (.cse40 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0))) (or (and .cse34 .cse10 .cse35 .cse22 .cse36 .cse37 .cse26 .cse38 .cse39 .cse28 .cse29 .cse40) (and .cse34 .cse10 .cse35 (<= (+ .cse11 1) ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse22 .cse36 .cse37 .cse39 .cse28 .cse29 .cse41 .cse40))))) (and .cse57 .cse2 .cse34 .cse43 .cse13 .cse35 .cse44 .cse45 .cse46 .cse17 .cse19 .cse20 .cse47 .cse48 .cse26 .cse38 .cse50 .cse58 .cse28 .cse51 .cse29 .cse59 .cse30 .cse31) (and .cse57 .cse2 .cse60 .cse61 .cse34 .cse43 .cse13 .cse35 .cse44 .cse45 .cse46 .cse17 .cse19 .cse62 .cse20 .cse47 .cse48 .cse26 .cse50 .cse58 .cse28 (<= 1 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse51 .cse29 .cse59 .cse30 .cse31 .cse63) (let ((.cse65 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse71)) (.cse66 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.offset|))) (and .cse2 .cse3 .cse4 .cse60 .cse5 .cse61 .cse6 .cse64 .cse7 (<= .cse8 .cse65) .cse9 .cse10 .cse12 .cse13 .cse16 (<= .cse66 .cse8) .cse17 .cse18 .cse19 (<= .cse65 .cse8) .cse20 .cse21 .cse22 .cse23 .cse67 .cse24 .cse25 .cse68 .cse69 (<= .cse8 .cse66) .cse26 .cse70 .cse28 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.base| .cse33) .cse29 .cse30 .cse31)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse72 .cse64 .cse7 .cse9 .cse10 .cse12 .cse13 .cse73 .cse16 .cse17 .cse18 (not (= .cse74 0)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse67 (not (= ULTIMATE.start_save_byte_from_array_~storage.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) .cse24 .cse25 .cse69 .cse26 .cse70 .cse28 .cse29 .cse30 .cse41 .cse31 .cse63) (and (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|) .cse0 .cse1 .cse2 .cse60 .cse5 .cse34 .cse72 .cse7 .cse13 .cse35 .cse14 .cse73 .cse16 .cse17 .cse18 .cse19 .cse20 .cse48 .cse23 .cse25 .cse68 .cse69 .cse26 .cse58 .cse28 .cse29 .cse30 .cse31 .cse63)))))) [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7386-18(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L8295-4(lines 8295 8310) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L8295-2(lines 8295 8310) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L8989(lines 8989 8991) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,279 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-24(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-29(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-28(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-26(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-32(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-30(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-36(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,280 INFO L858 garLoopResultBuilder]: For program point L7387-35(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,281 INFO L858 garLoopResultBuilder]: For program point L7387-34(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,281 INFO L854 garLoopResultBuilder]: At program point L8313(lines 8292 8314) the Hoare annotation is: (let ((.cse65 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 8))) (let ((.cse62 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|)) (.cse46 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse65)) (.cse66 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8))) (let ((.cse51 (div ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 18446744073709551616)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse66)) (.cse61 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse46)) (.cse54 (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (.cse33 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse66)) (.cse60 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse65)) (.cse59 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.base| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.offset| 0)) (.cse28 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset)) (.cse24 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse63 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse62))) (let ((.cse42 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse43 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse35 (<= .cse24 .cse63)) (.cse44 (<= ULTIMATE.start_aws_byte_cursor_advance_~len ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.offset| 0)) (.cse36 (<= 0 .cse28)) (.cse47 (or (not .cse8) (not .cse6))) (.cse38 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 |ULTIMATE.start_aws_byte_cursor_advance_#res.len|)) (.cse48 (let ((.cse64 (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse64) 0)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse64) 0))))) (.cse29 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset)) (.cse15 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) (+ ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 8)) 0))) (.cse27 (<= .cse24 (+ (* 18446744073709551616 (div .cse24 18446744073709551616)) 36028797018963967))) (.cse31 (<= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0)) (.cse49 (<= 1 .cse59)) (.cse50 (<= 1 |ULTIMATE.start_aws_byte_cursor_advance_#res.len|)) (.cse40 (<= .cse63 .cse24)) (.cse26 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))) (.cse12 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807)) (.cse41 (= .cse33 .cse60)) (.cse25 (= .cse54 1)) (.cse34 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.offset| .cse46)) (.cse52 (<= .cse0 .cse61)) (.cse45 (= .cse62 0)) (.cse53 (<= .cse61 .cse0)) (.cse30 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (.cse39 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.base| .cse60)) (.cse55 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))) (.cse56 (<= 0 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|)) (.cse2 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse3 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse4 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse7 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0)) (.cse10 (= .cse59 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0))) (.cse13 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse14 (= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 ULTIMATE.start_aws_byte_cursor_advance_~len)) (.cse16 (<= 0 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|)) (.cse18 (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (.cse19 (<= (+ 1 .cse51) 0)) (.cse20 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.len| 0)) (.cse57 (= .cse24 0)) (.cse21 (= (select |#valid| ULTIMATE.start_aws_byte_cursor_advance_~cursor.base) 1)) (.cse58 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 0)) (.cse22 (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14.base| 0))) (.cse23 (not (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.base 0)))) (or (and (= .cse0 0) .cse1 (let ((.cse17 (<= 1 .cse28))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ .cse24 1) ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse9 .cse10 .cse11 .cse12 .cse13 (or (not (= ULTIMATE.start_aws_byte_cursor_advance_~len 0)) (and .cse25 .cse26 .cse27)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23))) .cse29 (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset| 0) .cse30 .cse31 (let ((.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|))) (= (select .cse32 8) (select (select |#memory_int| .cse33) (select .cse32 |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset|))))) (let ((.cse37 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.offset|))) (and .cse2 .cse25 .cse34 .cse26 .cse3 .cse35 .cse4 .cse5 .cse36 .cse1 .cse7 .cse9 (<= .cse37 .cse0) .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse30 .cse27 .cse39 (<= .cse0 .cse37) .cse18 .cse40 .cse20 .cse21 (= |ULTIMATE.start_aws_byte_cursor_advance_#res.ptr.base| .cse33) .cse22 .cse23 (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset 0))) (and .cse41 (<= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|) .cse42 .cse34 .cse43 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse0) .cse4 .cse44 .cse5 (<= .cse24 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse36 .cse1 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 .cse24) .cse45 (= .cse46 0) .cse47 .cse9 .cse11 .cse38 .cse48 .cse12 .cse29 .cse15 .cse16 .cse30 .cse31 .cse39 .cse49 (<= .cse0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse18 .cse50 (<= .cse24 (+ (* 18446744073709551616 .cse51) 36028797018963967)) .cse21 (< |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 1)) .cse22 .cse23) (and .cse41 .cse42 .cse34 .cse43 .cse52 .cse35 .cse4 .cse44 .cse5 .cse36 .cse1 .cse53 .cse47 .cse9 .cse11 .cse38 .cse48 (not (= .cse54 0)) .cse12 .cse29 .cse15 .cse16 .cse30 .cse27 (not (= ULTIMATE.start_save_byte_from_array_~storage.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) .cse31 .cse39 .cse49 .cse18 .cse50 .cse40 .cse21 .cse22 .cse23 .cse55) (and .cse56 .cse2 .cse25 .cse26 .cse3 .cse4 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse20 .cse57 .cse21 (<= 1 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse58 .cse22 .cse23 .cse55) (and (= ULTIMATE.start_aws_byte_cursor_advance_~cursor.offset |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|) .cse41 .cse2 .cse25 .cse34 .cse3 .cse52 .cse4 .cse1 .cse7 .cse45 .cse53 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse30 .cse39 (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 0) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2) .cse18 .cse20 .cse57 .cse21 .cse22 .cse23 .cse55) (and .cse56 .cse2 .cse3 .cse4 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse57 .cse21 .cse58 .cse22 .cse23)))))) [2021-11-02 13:07:23,282 INFO L858 garLoopResultBuilder]: For program point L7387-41(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,282 INFO L858 garLoopResultBuilder]: For program point L7387-40(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,282 INFO L858 garLoopResultBuilder]: For program point L7387-38(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,282 INFO L858 garLoopResultBuilder]: For program point L7387-44(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-42(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-48(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-47(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-46(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-53(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-52(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-50(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-56(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,283 INFO L858 garLoopResultBuilder]: For program point L7387-54(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L7387-59(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L7387-58(line 7387) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8998) no Hoare annotation was computed. [2021-11-02 13:07:23,284 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L222-8(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,285 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,286 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,287 INFO L858 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point L7128(lines 7128 7132) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point L7129(lines 7129 7131) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point L8980(lines 8980 8984) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point L8980-2(lines 8980 8997) no Hoare annotation was computed. [2021-11-02 13:07:23,288 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L8980-3(lines 8980 8997) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-02 13:07:23,289 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-02 13:07:23,290 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse0) 0) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse0) 0) (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1) (<= (select (select |#memory_int| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) 9223372036854775807) (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (and (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2))) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0))) [2021-11-02 13:07:23,290 INFO L861 garLoopResultBuilder]: At program point L8999(line 8999) the Hoare annotation is: true [2021-11-02 13:07:23,290 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,290 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (let ((.cse3 (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)))) (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8)) (.cse1 (+ .cse3 36028797018963967)) (.cse2 (select (select |#memory_int| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset))) (and (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse0)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= ULTIMATE.start_bounded_malloc_~size .cse1)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< .cse1 ULTIMATE.start_bounded_malloc_~size))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse0) 0) (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (not (= |ULTIMATE.start_bounded_malloc_#res.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (<= .cse2 .cse1) (<= .cse3 .cse2) (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1) (<= .cse2 9223372036854775807) (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (and (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2))) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0)))) [2021-11-02 13:07:23,290 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 8)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| 8))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse1)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|)) (.cse7 (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616))) (.cse6 (select (select |#memory_int| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse5)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset|))) (and (= .cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) .cse1)) (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|) 1) (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (<= .cse2 .cse3) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base| ULTIMATE.start_save_byte_from_array_~storage.base) (= ULTIMATE.start_save_byte_from_array_~array.offset .cse4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) .cse5) .cse4) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= 1 .cse2) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (= .cse4 0) (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| 0)) (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (not (= |ULTIMATE.start_bounded_malloc_#res.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|)) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.offset| 0) (<= .cse6 (+ .cse7 36028797018963967)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (<= .cse3 .cse2) (<= .cse7 .cse6) (not (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old_byte_from_cursor~0.base|) 0)) (= .cse0 ULTIMATE.start_save_byte_from_array_~array.base) (not (= ULTIMATE.start_save_byte_from_array_~storage.base |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|)) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (<= .cse2 9223372036854775807) (= (select |#valid| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base|) 1) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.offset| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset|) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0)) (= ULTIMATE.start_save_byte_from_array_~storage.offset 0) (<= (+ ULTIMATE.start_save_byte_from_array_~array.base 1) |#StackHeapBarrier|) (or (and (<= (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 1) 0) (<= 0 (+ ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775808))) (and (<= ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2 9223372036854775807) (<= 0 ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2))) (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2.base| |ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0.base|))))) [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point L7134(lines 7134 7140) no Hoare annotation was computed. [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point L7135(lines 7135 7139) no Hoare annotation was computed. [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point L6673-2(lines 6673 6675) no Hoare annotation was computed. [2021-11-02 13:07:23,291 INFO L858 garLoopResultBuilder]: For program point L6673(lines 6673 6675) no Hoare annotation was computed. [2021-11-02 13:07:23,321 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] [2021-11-02 13:07:23,323 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 13:07:23,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,368 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,369 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,381 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,395 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,395 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,399 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,418 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,418 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,423 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,424 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,425 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,426 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,426 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,426 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,426 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,426 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,427 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,428 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,429 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,429 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,430 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,430 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,431 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,431 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,431 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,433 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,433 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,434 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,434 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,435 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,437 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,438 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,439 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,445 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,447 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,448 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,449 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,449 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,450 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,450 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,451 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,452 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,453 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,453 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,453 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,453 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,453 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,454 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,455 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,456 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,457 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,458 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,458 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,458 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,458 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,458 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,458 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,459 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,459 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,459 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,459 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,459 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,459 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,460 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,461 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,467 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,467 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,468 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,468 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,470 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,473 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,473 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,473 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,473 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,474 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,474 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,474 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,474 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,474 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,475 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,475 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,475 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,475 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,475 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,476 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,476 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,477 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,478 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,481 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,481 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,482 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,482 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,482 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,483 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,483 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,484 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,485 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,485 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,486 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,486 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,487 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,488 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,488 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,489 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,489 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,489 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,490 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,490 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,491 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,491 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,492 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_advance_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-02 13:07:23,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,497 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,498 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,499 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,500 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,501 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,502 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,503 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,504 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,508 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,509 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,510 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:07:23,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:07:23,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 01:07:23 BoogieIcfgContainer [2021-11-02 13:07:23,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 13:07:23,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 13:07:23,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 13:07:23,531 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 13:07:23,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:53:24" (3/4) ... [2021-11-02 13:07:23,534 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 13:07:23,552 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2021-11-02 13:07:23,554 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2021-11-02 13:07:23,555 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-02 13:07:23,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-02 13:07:23,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-02 13:07:23,557 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 13:07:23,558 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 13:07:23,559 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 13:07:23,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == #memory_$Pointer$[cursor][cursor + 8]) && \result == 0) && !(\result == 0)) && cursor == cursor) && ((cond == 1 && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) || (cond == 0 && 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967 < size))) && #memory_$Pointer$[cursor][cursor + 8] == 0) && !(cursor == 0)) && cursor == cursor) && !(\result == cursor)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 18446744073709551616 * (size / 18446744073709551616) <= unknown-#memory_int-unknown[cursor][cursor]) && \valid[cursor] == 1) && unknown-#memory_int-unknown[cursor][cursor] <= 9223372036854775807) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0 [2021-11-02 13:07:23,586 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\result <= 1 && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == #memory_$Pointer$[cursor][cursor + 8]) && \result == 0) && !(\result == 0)) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && #memory_$Pointer$[cursor][cursor + 8] + 1 <= unknown-#StackHeapBarrier-unknown) && ((cond == 1 && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) || (cond == 0 && 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967 < size))) && !(cursor == 0)) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && cursor == cursor) && 18446744073709551616 * (size / 18446744073709551616) <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && \valid[cursor] == 1) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 9223372036854775807) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0) || ((((((((((cursor == 0 && cursor == cursor) && !(cursor == 0)) && 0 <= \result) && cursor == cursor) && \result <= 0) && !(unknown-#memory_int-unknown[cursor][cursor] == 0)) && 0 <= len + 9223372036854775808) && cursor == cursor) && \valid[cursor] == 1) && cursor == 0)) || ((((((((((\result <= 1 && cursor == 0) && cursor == 0) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && 1 <= \result) && cursor == cursor) && \valid[cursor] == 1) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0) [2021-11-02 13:07:23,586 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && \result <= 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[\old] == 1) && !(cursor == storage)) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[cursor][cursor]) && \result == 0) && \old_byte_from_cursor == storage) && array == #memory_$Pointer$[\old][\old + 8]) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && !(\result == 0)) && 1 <= unknown-#memory_int-unknown[\old][\old]) && cursor == cursor) && #memory_$Pointer$[\old][\old + 8] == 0) && !(cursor == 0)) && !(array == storage)) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && \old_byte_from_cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) && 18446744073709551616 * (size / 18446744073709551616) <= unknown-#memory_int-unknown[cursor][cursor]) && !(\valid[\old_byte_from_cursor] == 0)) && #memory_$Pointer$[cursor][cursor + 8] == array) && !(storage == \old)) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 9223372036854775807) && \valid[cursor] == 1) && \old == cursor) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && storage == 0) && array + 1 <= unknown-#StackHeapBarrier-unknown) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0) && !(cursor == \old) [2021-11-02 13:07:23,586 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((\result <= 1 && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[\old] == 1) && !(cursor == storage)) && \result == 0) && \old_byte_from_cursor == storage) && array == #memory_$Pointer$[\old][\old + 8]) && cursor == cursor) && !(\result == 0)) && rv == 0) && 1 <= unknown-#memory_int-unknown[\old][\old]) && cursor == cursor) && #memory_$Pointer$[\old][\old + 8] == 0) && !(array == storage)) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && unknown-#memory_int-unknown[#memory_$Pointer$[cursor][cursor + 8]][unknown-#memory_int-unknown[\old_byte_from_cursor][\old_byte_from_cursor]] == unknown-#memory_int-unknown[\old_byte_from_cursor][8]) && \old_byte_from_cursor == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && len == len) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old] + len) && 18446744073709551616 * (size / 18446744073709551616) <= unknown-#memory_int-unknown[cursor][cursor]) && !(\valid[\old_byte_from_cursor] == 0)) && cursor == cursor) && #memory_$Pointer$[cursor][cursor + 8] == array) && !(storage == \old)) && !(rv == \old_byte_from_cursor)) && cursor == cursor) && \valid[cursor] == 1) && \old == cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && storage == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 9223372036854775807) && array + 1 <= unknown-#StackHeapBarrier-unknown) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0) && !(rv == 0)) && unknown-#memory_int-unknown[\old][\old] + len <= len + unknown-#memory_int-unknown[cursor][cursor]) && !(cursor == 0)) && cursor == 0) && !(cursor == \old)) || ((((((((((((((!(cursor == storage) && cursor == cursor) && cursor == 0) && cursor == cursor) && 0 <= \result) && cursor == cursor) && 0 <= 9223372036854775808 + len) && \result <= 0) && cursor == cursor) && !(unknown-#memory_int-unknown[cursor][cursor] == 0)) && 0 <= len + 9223372036854775808) && cursor == cursor) && \valid[cursor] == 1) && cursor == 0) && !(cursor == 0))) || (((((((((((((((((((((\result <= 1 && \valid[\old] == 1) && \old == 0) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] == 0) && cursor == cursor) && size == 0) && 1 <= \result) && cursor == cursor) && len == len) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] == 0) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && \valid[cursor] == 1) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(cursor == \old)) [2021-11-02 13:07:23,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((unknown-#memory_int-unknown[cursor][cursor] == 0 && 0 <= \old) && \result <= 1) && cursor == cursor) && cursor == cursor) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && len == len) && rv == 0) && 0 <= 9223372036854775808 + len) && !(rv == cursor)) && #memory_$Pointer$[rv][rv + 8] == 0) && cursor == cursor) && 0 <= len + 9223372036854775808) && 1 + len / 18446744073709551616 <= 0) && unknown-#memory_int-unknown[rv][rv] == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && \valid[cursor] == 1) && cursor == 0) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && !(cursor == \old)) || (((((((((((((((((((((((((((((((unknown-#memory_int-unknown[cursor][cursor] == 0 && 0 <= \old) && \result <= 1) && \valid[\old] == 1) && !(cursor == \old)) && cursor == cursor) && !(rv == \old)) && cursor == cursor) && !(cursor == 0)) && cursor == cursor) && len <= 9223372036854775807) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && len == len) && rv == 0) && 0 <= 9223372036854775808 + len) && !(rv == cursor)) && #memory_$Pointer$[rv][rv + 8] == 0) && cursor == cursor) && 0 <= len + 9223372036854775808) && unknown-#memory_int-unknown[rv][rv] == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && \valid[cursor] == 1) && 1 <= len) && cursor == 0) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && !(cursor == \old))) || (((((((((((((((((((((((((((((((((((\result <= 1 && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && !(\result == 0)) && rv == 0) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && !(\valid[\old] == 0)) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && len == unknown-#memory_int-unknown[rv][rv]) && len == len) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && !(storage == \old)) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && #memory_$Pointer$[rv][rv + 8] == #memory_$Pointer$[\old][\old + 8]) && cursor == cursor) && 0 <= len) && ((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && !(cursor == \old)) && #memory_$Pointer$[\old][\old + 8] == 0) && #memory_$Pointer$[cursor][cursor + 8] <= len) || cursor == \old)) && \valid[cursor] == 1) && cursor <= rv) && #memory_$Pointer$[\old][\old + 8] == #memory_$Pointer$[rv][rv + 8]) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && len + #memory_$Pointer$[rv][rv + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && cursor == 0) && \old < cursor + 1) && !(rv == 0)) && (!(len == 0) || ((((len <= len && \valid[\old] == 1) && !(cursor == \old)) && len <= len) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967))) && !(cursor == 0)) && !(rv == 0)) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old])) || (((((((((((((((((((((((((((((((((unknown-#memory_int-unknown[cursor][cursor] == 0 && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && \result <= 1) && \valid[\old] == 1) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[\old][\old + 8]) && cursor == cursor) && !(rv == \old)) && cursor == cursor) && len + #memory_$Pointer$[\old][\old + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && len == len) && rv == 0) && 0 <= 9223372036854775808 + len) && cursor == cursor) && !(rv == cursor)) && len <= 0) && 0 <= len) && cursor == cursor) && 0 <= len + 9223372036854775808) && unknown-#memory_int-unknown[rv][rv] == 0) && #memory_$Pointer$[rv][rv + 8] == #memory_$Pointer$[\old][\old + 8]) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && #memory_$Pointer$[\old][\old + 8] == #memory_$Pointer$[rv][rv + 8]) && rv < \old + 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && !(cursor == \old)) && \old <= rv)) || (((((((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[cursor][cursor + 8] == 0) && \result == #memory_$Pointer$[cursor][cursor + 8]) && !(rv == \old_byte_from_cursor)) && #memory_$Pointer$[cursor][cursor + 8] + 1 <= unknown-#StackHeapBarrier-unknown) && \old_byte_from_cursor == 0) && (((((((((((((((((((((((((((((\result <= 1 && cursor == cursor) && !(\result == 0)) && rv == 0) && !(rv == \old)) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] + 1 <= len) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && len == len) && rv == 0) && #memory_$Pointer$[rv][rv + 8] == 0) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && (rv == \old || #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8])) && unknown-#memory_int-unknown[rv][rv] == 0) && \valid[cursor] == 1) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && (rv == \old || #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8])) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && !(rv == 0)) && (!(len == 0) || ((((len <= len && \valid[\old] == 1) && !(cursor == \old)) && len <= len) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967))) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && !(cursor == \old)) && \old <= rv) || ((((((((((((((((((((((((((\result <= 1 && cursor == cursor) && !(\result == 0)) && rv == 0) && cursor == cursor) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && len == len) && rv == 0) && #memory_$Pointer$[rv][rv + 8] == 0) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && (rv == \old || #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8])) && 1 + len / 18446744073709551616 <= 0) && unknown-#memory_int-unknown[rv][rv] == 0) && \valid[cursor] == 1) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && (rv == \old || #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8])) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && !(cursor == \old)) && \old <= rv))) && cursor == cursor) && !(rv == #memory_$Pointer$[cursor][cursor + 8])) && unknown-#memory_int-unknown[\old_byte_from_cursor][8] == unknown-#memory_int-unknown[#memory_$Pointer$[cursor][cursor + 8]][unknown-#memory_int-unknown[\old_byte_from_cursor][\old_byte_from_cursor]]) && cursor == cursor) && cursor == 0)) || (((((((((((((((((((((((((((((((((\result <= 1 && cursor == cursor) && !(\result == 0)) && rv == 0) && unknown-#memory_int-unknown[\old][\old] <= len) && !(rv == \old)) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && len == unknown-#memory_int-unknown[rv][rv]) && cursor == cursor) && len == len) && #memory_$Pointer$[rv][rv + 8] == #memory_$Pointer$[\old][\old + 8]) && cursor == cursor) && 0 <= len) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && !(unknown-#memory_int-unknown[rv][rv] == 0)) && ((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && !(cursor == \old)) && #memory_$Pointer$[\old][\old + 8] == 0) && #memory_$Pointer$[cursor][cursor + 8] <= len) || cursor == \old)) && \valid[cursor] == 1) && cursor <= rv) && #memory_$Pointer$[\old][\old + 8] == #memory_$Pointer$[rv][rv + 8]) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && len + #memory_$Pointer$[rv][rv + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && cursor == 0) && \old < cursor + 1) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) [2021-11-02 13:07:23,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((\result <= 1 && \valid[\old] == 1) && cond / 256 <= 0) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && !(\result == 0)) && rv == 0) && !(rv == \old)) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && 1 <= cond) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[rv][rv + 8]) && !(cursor == 0)) && unknown-#memory_int-unknown[rv][rv] <= 0) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && len == len) && rv == 0) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && 0 <= unknown-#memory_int-unknown[rv][rv]) && !(rv == cursor)) && len <= 0) && 0 <= len + 9223372036854775808) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[rv][rv + 8]) && #memory_$Pointer$[rv][rv + 8] == #memory_$Pointer$[\old][\old + 8]) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) && 0 <= len) && rv == cursor) && \valid[cursor] == 1) && rv == cursor) && #memory_$Pointer$[\old][\old + 8] == #memory_$Pointer$[rv][rv + 8]) && len + #memory_$Pointer$[rv][rv + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && rv < \old + 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && cursor == 0) && !(rv == 0)) && !(cursor == \old)) && \old <= rv) || (((((((((((((((((((((((((((((((0 <= \old && \result <= 1) && \valid[\old] == 1) && !(cursor == \old)) && cond / 256 <= 0) && !(rv == \old)) && cursor == cursor) && 1 <= cond) && !(cursor == 0)) && unknown-#memory_int-unknown[rv][rv] <= 0) && cursor == cursor) && len <= 9223372036854775807) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && len == len) && rv == 0) && !(rv == cursor)) && #memory_$Pointer$[rv][rv + 8] == 0) && 0 <= len + 9223372036854775808) && unknown-#memory_int-unknown[rv][rv] == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && rv == cursor) && \valid[cursor] == 1) && \valid[cursor] == 1) && rv == cursor) && 1 <= len) && cursor == 0) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) && !(rv == 0)) && !(cursor == \old))) || ((((((((((((((((((((((((((((((((((((((((((((!(#memory_$Pointer$[cursor][8] == 0) && \result <= 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[cursor][cursor + 8] == 0) && \result == #memory_$Pointer$[cursor][cursor + 8]) && cursor == 0) && cond / 256 <= 0) && !(\result == 0)) && !(rv == \old_byte_from_cursor)) && rv == 0) && cursor == cursor) && 1 <= cond) && #memory_$Pointer$[cursor][cursor + 8] + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && unknown-#memory_int-unknown[rv][rv] <= 0) && cursor == cursor) && !(\result == cursor)) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && cursor <= cursor) && \old_byte_from_cursor == 0) && ((\valid[\old] == 1 && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) || !(len == 0))) && len == len) && cursor == cursor) && cursor <= 0) && (unknown-#memory_int-unknown[\old][\old] + 1 <= len || 1 + len / 18446744073709551616 <= 0)) && !(rv == #memory_$Pointer$[cursor][cursor + 8])) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && #memory_$Pointer$[rv][rv + 8] == 0) && unknown-#memory_int-unknown[\old_byte_from_cursor][8] == unknown-#memory_int-unknown[#memory_$Pointer$[cursor][cursor + 8]][unknown-#memory_int-unknown[\old_byte_from_cursor][\old_byte_from_cursor]]) && 0 <= len + 9223372036854775808) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && rv == cursor) && \valid[cursor] == 1) && rv == cursor) && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && !(rv == 0)) && !(cursor == \old)) && \old <= rv)) || ((((((((((((((((((((((((((((((((((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && \result <= 1) && \valid[\old] == 1) && !(cursor == \old)) && cond / 256 <= 0) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[\old][\old + 8]) && 0 <= cursor) && !(rv == \old)) && cursor == cursor) && 1 <= cond) && unknown-#memory_int-unknown[cursor][cursor] == 0) && len + #memory_$Pointer$[\old][\old + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && !(cursor == 0)) && unknown-#memory_int-unknown[rv][rv] <= 0) && cursor == cursor) && 1 <= \result) && len == len) && rv == 0) && cursor == cursor) && !(rv == cursor)) && len <= 0) && 0 <= len) && 0 <= len + 9223372036854775808) && unknown-#memory_int-unknown[rv][rv] == 0) && #memory_$Pointer$[rv][rv + 8] == #memory_$Pointer$[\old][\old + 8]) && unknown-#memory_int-unknown[\old][\old] == 0) && rv == cursor) && \valid[cursor] == 1) && cursor <= rv) && rv == cursor) && #memory_$Pointer$[\old][\old + 8] == #memory_$Pointer$[rv][rv + 8]) && rv < \old + 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && !(rv == 0)) && \old <= rv)) || ((((((((((((((((((((((((((((0 <= \old && \result <= 1) && cond / 256 <= 0) && cursor == cursor) && 1 <= cond) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && unknown-#memory_int-unknown[rv][rv] <= 0) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][rv + 8] == 0) && len == len) && rv == 0) && !(rv == cursor)) && #memory_$Pointer$[rv][rv + 8] == 0) && 0 <= len + 9223372036854775808) && 1 + len / 18446744073709551616 <= 0) && unknown-#memory_int-unknown[\old][\old] == 0) && rv == cursor) && \valid[cursor] == 1) && \valid[cursor] == 1) && rv == cursor) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && cursor == 0) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) && !(rv == 0)) && !(cursor == \old))) || ((((((((((((((((((((((((((((((((((((\result <= 1 && cond / 256 <= 0) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && !(\result == 0)) && cursor == 0) && rv == 0) && !(rv == \old)) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && 1 <= cond) && !(\valid[\old] == 0)) && !(\result == cursor)) && 1 <= \result) && len == unknown-#memory_int-unknown[rv][rv]) && len == len) && rv == 0) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && !(storage == \old)) && cursor == \old) && (!(#memory_$Pointer$[rv][rv + 8] == 0) || !(#memory_$Pointer$[cursor][8 + cursor] == 0))) && (cursor == \old || ((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && !(cursor == \old)) && len <= #memory_$Pointer$[cursor][cursor + 8]) && #memory_$Pointer$[\old][\old + 8] == 0) && #memory_$Pointer$[cursor][cursor + 8] <= len))) && (rv == cursor || ((#memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[rv][rv + 8] && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[rv][rv + 8]) && len + #memory_$Pointer$[rv][rv + 8] <= #memory_$Pointer$[cursor][cursor + 8]))) && 0 <= len) && !(unknown-#memory_int-unknown[rv][rv] == 0)) && rv == cursor) && \valid[cursor] == 1) && rv == cursor) && #memory_$Pointer$[\old][\old + 8] == #memory_$Pointer$[rv][rv + 8]) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && !(rv == 0)) && \old <= rv) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old])) || ((((((((((((((((((((((((((((((((\result <= 1 && cond / 256 <= 0) && !(\result == 0)) && cursor == 0) && rv == 0) && unknown-#memory_int-unknown[\old][\old] <= len) && !(rv == \old)) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && 1 <= cond) && !(\result == cursor)) && 1 <= \result) && len == unknown-#memory_int-unknown[rv][rv]) && len == len) && rv == 0) && cursor == cursor) && cursor == \old) && (!(#memory_$Pointer$[rv][rv + 8] == 0) || !(#memory_$Pointer$[cursor][8 + cursor] == 0))) && (cursor == \old || ((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && !(cursor == \old)) && len <= #memory_$Pointer$[cursor][cursor + 8]) && #memory_$Pointer$[\old][\old + 8] == 0) && #memory_$Pointer$[cursor][cursor + 8] <= len))) && (rv == cursor || ((#memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[rv][rv + 8] && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[rv][rv + 8]) && len + #memory_$Pointer$[rv][rv + 8] <= #memory_$Pointer$[cursor][cursor + 8]))) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && !(unknown-#memory_int-unknown[rv][rv] == 0)) && rv == cursor) && \valid[cursor] == 1) && rv == cursor) && ((len + 1 <= 0 && 0 <= len + 9223372036854775808) || (len <= 9223372036854775807 && 0 <= len))) && rv < \old + 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && !(rv == 0)) && \old <= rv) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) [2021-11-02 13:07:23,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((#memory_$Pointer$[cursor][cursor + 8] == 0 && cursor == cursor) && ((((((((((((((((((((((\result <= 1 && cond / 256 <= 0) && cursor == 0) && rv == 0) && aws_byte_cursor_advance_#res.ptr == 0) && 1 <= cond) && aws_byte_cursor_advance_#res.ptr == 0) && cursor <= 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && len <= 9223372036854775807) && 1 <= \result) && len == len) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && 0 <= cursor) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && 0 <= len + 9223372036854775808) && 1 + len / 18446744073709551616 <= 0) && unknown-#res!len-unknown == 0) && \valid[cursor] == 1) && !(rv == 0)) && !(cursor == 0)) || ((((((((((((((((((((((\result <= 1 && cond / 256 <= 0) && cursor == 0) && rv == 0) && aws_byte_cursor_advance_#res.ptr == 0) && 1 <= cond) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[\old][\old] + 1 <= len) && cursor <= 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && len <= 9223372036854775807) && 1 <= \result) && (!(len == 0) || ((\valid[\old] == 1 && !(cursor == \old)) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967))) && len == len) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && 0 <= cursor) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && \valid[cursor] == 1) && !(rv == 0)) && !(cursor == 0)))) && cursor <= cursor) && \old_byte_from_cursor == 0) && cursor == cursor) && cursor <= 0) && unknown-#memory_int-unknown[\old_byte_from_cursor][8] == unknown-#memory_int-unknown[#memory_$Pointer$[cursor][cursor + 8]][unknown-#memory_int-unknown[\old_byte_from_cursor][\old_byte_from_cursor]]) || (((((((((((((((((((((((((((((((\result <= 1 && \valid[\old] == 1) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && !(cursor == \old)) && cond / 256 <= 0) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && cursor == 0) && rv == 0) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && 1 <= cond) && cursor <= 0) && len + aws_byte_cursor_advance_#res.ptr <= #memory_$Pointer$[cursor][cursor + 8]) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && len == unknown-#res!len-unknown) && 1 <= \result) && len == len) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && 0 <= cursor) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && #memory_$Pointer$[cursor][cursor + 8] <= len + aws_byte_cursor_advance_#res.ptr) && 0 <= len + 9223372036854775808) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) && unknown-#res!len-unknown == 0) && \valid[cursor] == 1) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[cursor][cursor + 8]) && !(rv == 0)) && !(cursor == 0)) && cursor == 0)) || (((((((((((((((((((((((((((((((((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && cursor <= \old) && len <= len) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && cursor == 0) && len <= #memory_$Pointer$[cursor][cursor + 8]) && cursor == 0) && len <= len) && rv == 0) && unknown-#memory_int-unknown[\old][\old] <= len) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && len <= unknown-#memory_int-unknown[\old][\old]) && unknown-#memory_int-unknown[cursor][cursor] == 0) && #memory_$Pointer$[\old][\old + 8] == 0) && (!(aws_byte_cursor_advance_#res.ptr == 0) || !(aws_byte_cursor_advance_#res.ptr == 0))) && cursor <= 0) && !(cursor == 0)) && len == unknown-#res!len-unknown) && (!(#memory_$Pointer$[cursor][8 + cursor] == 0) || !(#memory_$Pointer$[cursor][8 + cursor] == 0))) && len <= 9223372036854775807) && cursor <= cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && 0 <= cursor) && cursor == cursor) && cursor <= 0) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && #memory_$Pointer$[cursor][cursor + 8] <= len) && 0 <= len + 9223372036854775808) && 1 <= unknown-#res!len-unknown) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && \valid[cursor] == 1) && \old < cursor + 1) && !(rv == 0)) && !(cursor == 0))) || ((((((((((((((((((((((((((((((((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && len <= len) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && cursor == 0) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[\old][\old + 8]) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && cursor == 0) && len <= len) && rv == 0) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && len + #memory_$Pointer$[\old][\old + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && (!(aws_byte_cursor_advance_#res.ptr == 0) || !(aws_byte_cursor_advance_#res.ptr == 0))) && cursor <= 0) && !(cursor == 0)) && len == unknown-#res!len-unknown) && (!(#memory_$Pointer$[cursor][8 + cursor] == 0) || !(#memory_$Pointer$[cursor][8 + cursor] == 0))) && !(\valid[\old] == 0)) && len <= 9223372036854775807) && cursor <= cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && 0 <= cursor) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && !(storage == \old)) && cursor <= 0) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && 0 <= len + 9223372036854775808) && 1 <= unknown-#res!len-unknown) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) && \valid[cursor] == 1) && !(rv == 0)) && !(cursor == 0)) && !(cursor == \old))) || (((((((((((((((((((((((((0 <= \old && \result <= 1) && \valid[\old] == 1) && !(cursor == \old)) && cond / 256 <= 0) && cursor == 0) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && 1 <= cond) && aws_byte_cursor_advance_#res.ptr == 0) && cursor <= 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && len <= 9223372036854775807) && 1 <= \result) && len == len) && 0 <= cursor) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && 1 <= len) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) && !(cursor == \old))) || ((((((((((((((((((((((((((((cursor == cursor && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && \result <= 1) && \valid[\old] == 1) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && cond / 256 <= 0) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[\old][\old + 8]) && cursor == 0) && cursor == cursor) && 1 <= cond) && unknown-#memory_int-unknown[cursor][cursor] == 0) && len + #memory_$Pointer$[\old][\old + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && cursor <= 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && 1 <= \result) && len == len) && 0 <= cursor) && cursor == cursor) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && len <= 0) && 0 <= len) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && !(rv == 0)) && !(cursor == 0)) && !(cursor == \old))) || (((((((((((((((((((((0 <= \old && \result <= 1) && cond / 256 <= 0) && cursor == 0) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && 1 <= cond) && aws_byte_cursor_advance_#res.ptr == 0) && cursor <= 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && 1 <= \result) && len == len) && 0 <= cursor) && 0 <= len + 9223372036854775808) && 1 + len / 18446744073709551616 <= 0) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) [2021-11-02 13:07:23,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && cursor <= \old) && \result <= 1) && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && len <= len) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && (!(len == 0) || 1 <= unknown-#memory_int-unknown[cursor][cursor])) && len == unknown-#memory_int-unknown[rv][rv]) && len <= #memory_$Pointer$[cursor][cursor + 8]) && len <= len) && rv == 0) && unknown-#memory_int-unknown[\old][\old] <= len) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && len <= unknown-#memory_int-unknown[\old][\old]) && unknown-#memory_int-unknown[cursor][cursor] == 0) && #memory_$Pointer$[\old][\old + 8] == 0) && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && !(cursor == 0)) && len == unknown-#res!len-unknown) && cursor == cursor) && 1 <= \result) && cursor <= cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && cursor <= 0) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && #memory_$Pointer$[cursor][cursor + 8] <= len) && 0 <= len + 9223372036854775808) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && \valid[cursor] == 1) && cursor == 0) && \old < cursor + 1) && !(rv == 0)) && !(cursor == 0)) || ((((#memory_$Pointer$[cursor][cursor + 8] == 0 && \old_byte_from_cursor == 0) && cursor == cursor) && unknown-#memory_int-unknown[\old_byte_from_cursor][8] == unknown-#memory_int-unknown[#memory_$Pointer$[cursor][cursor + 8]][unknown-#memory_int-unknown[\old_byte_from_cursor][\old_byte_from_cursor]]) && ((((((((((((cond / 256 <= 0 && rv == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && !(unknown-#memory_int-unknown[cursor][cursor] == 0)) && !(\valid[cursor] == 0)) && 0 <= len + 9223372036854775808) && 1 + len / 18446744073709551616 <= 0) && (((((((((((((((((((\result <= 1 && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && unknown-#memory_int-unknown[cursor][0] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && #memory_$Pointer$[rv][8 + rv] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][8 + rv] == 0) && len == len) && ((unknown-#memory_int-unknown[cursor][cursor] == 0 || !(#memory_$Pointer$[cursor][8] == 0)) || !(#memory_$Pointer$[cursor][8] == 0))) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && 0 == unknown-#memory_int-unknown[rv][rv]) && !(rv == 0)) && !(cursor == 0)) || ((((((((((((((((((\result <= 1 && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && #memory_$Pointer$[rv][8 + rv] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][8 + rv] == 0) && len == len) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && ((unknown-#memory_int-unknown[cursor][cursor] == 0 || !(#memory_$Pointer$[cursor][8] == 0)) || !(#memory_$Pointer$[cursor][8] == 0))) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && 0 == unknown-#memory_int-unknown[rv][rv]) && !(rv == 0)) && !(cursor == 0)))) && \valid[cursor] == 1) && cursor == 0) && cursor == 0) || (((((((((((cond / 256 <= 0 && rv == 0) && 1 <= cond) && unknown-#memory_int-unknown[\old][\old] + 1 <= len) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && !(unknown-#memory_int-unknown[cursor][cursor] == 0)) && !(\valid[cursor] == 0)) && (((((((((((((((((((\result <= 1 && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && unknown-#memory_int-unknown[cursor][0] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && #memory_$Pointer$[rv][8 + rv] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][8 + rv] == 0) && len == len) && ((unknown-#memory_int-unknown[cursor][cursor] == 0 || !(#memory_$Pointer$[cursor][8] == 0)) || !(#memory_$Pointer$[cursor][8] == 0))) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && 0 == unknown-#memory_int-unknown[rv][rv]) && !(rv == 0)) && !(cursor == 0)) || ((((((((((((((((((\result <= 1 && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && #memory_$Pointer$[rv][8 + rv] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][8 + rv] == 0) && len == len) && 1 <= unknown-#memory_int-unknown[cursor][cursor]) && ((unknown-#memory_int-unknown[cursor][cursor] == 0 || !(#memory_$Pointer$[cursor][8] == 0)) || !(#memory_$Pointer$[cursor][8] == 0))) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && 0 == unknown-#memory_int-unknown[rv][rv]) && !(rv == 0)) && !(cursor == 0)))) && \valid[cursor] == 1) && cursor == 0) && (!(len == 0) || ((((len <= len && \valid[\old] == 1) && !(cursor == \old)) && len <= len) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967))) && cursor == 0)))) || (((((((((((((((((((((((0 <= \old && \result <= 1) && cond / 256 <= 0) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && 1 <= cond) && #memory_$Pointer$[rv][8 + rv] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && cursor == cursor) && 1 <= \result) && #memory_$Pointer$[rv][8 + rv] == 0) && len == len) && 0 <= len + 9223372036854775808) && 1 + len / 18446744073709551616 <= 0) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && 0 == unknown-#memory_int-unknown[rv][rv]) && cursor == 0) && \old <= 0) && !(rv == 0)) && !(cursor == 0))) || (((((((((((((((((((((((((((0 <= \old && \result <= 1) && \valid[\old] == 1) && !(cursor == \old)) && cond / 256 <= 0) && aws_byte_cursor_advance_#res.ptr == 0) && cursor == cursor) && 1 <= cond) && #memory_$Pointer$[rv][8 + rv] == 0) && aws_byte_cursor_advance_#res.ptr == 0) && unknown-#memory_int-unknown[cursor][cursor] == 0) && !(cursor == 0)) && cursor == cursor) && len <= 9223372036854775807) && 1 <= \result) && #memory_$Pointer$[rv][8 + rv] == 0) && len == len) && 0 <= len + 9223372036854775808) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && 1 <= len) && 0 == unknown-#memory_int-unknown[rv][rv]) && cursor == 0) && \old <= 0) && !(rv == 0)) && !(cursor == 0)) && !(cursor == \old))) || ((((((((((((((((((((((((((((((((((((\result <= 1 && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && len <= len) && \valid[\old] == 1) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && !(cursor == \old)) && (!(len == 0) || 1 <= unknown-#memory_int-unknown[cursor][cursor])) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && len == unknown-#memory_int-unknown[rv][rv]) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[rv][8 + rv]) && len <= len) && rv == 0) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && len + aws_byte_cursor_advance_#res.ptr <= #memory_$Pointer$[cursor][cursor + 8]) && !(cursor == 0)) && len == unknown-#res!len-unknown) && cursor == cursor) && len + #memory_$Pointer$[rv][8 + rv] <= #memory_$Pointer$[cursor][cursor + 8]) && 1 <= \result) && cursor <= cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && cursor <= 0) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && len <= 0) && 0 <= len) && #memory_$Pointer$[cursor][cursor + 8] <= len + aws_byte_cursor_advance_#res.ptr) && 0 <= len + 9223372036854775808) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) && \valid[cursor] == 1) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[cursor][cursor + 8]) && cursor == 0) && !(rv == 0)) && !(cursor == 0))) || ((((((((((((((((((((((((((((((((((((#memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8] && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && \result <= 1) && ((0 <= len + 9223372036854775808 && 1 + len / 18446744073709551616 <= 0) || (len <= 9223372036854775807 && 0 <= len))) && len <= len) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && (!(len == 0) || 1 <= unknown-#memory_int-unknown[cursor][cursor])) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[\old][\old + 8]) && unknown-#memory_int-unknown[\old][\old] <= len + unknown-#memory_int-unknown[cursor][cursor]) && len == unknown-#memory_int-unknown[rv][rv]) && len <= len) && rv == 0) && 0 <= unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && len + #memory_$Pointer$[\old][\old + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && !(cursor == 0)) && len == unknown-#res!len-unknown) && !(\valid[\old] == 0)) && cursor == cursor) && 1 <= \result) && cursor <= cursor) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == cursor) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967) && !(storage == \old)) && cursor <= 0) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && 0 <= len) && 0 <= len + 9223372036854775808) && len + unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[\old][\old]) && \valid[cursor] == 1) && cursor == 0) && !(rv == 0)) && (!(len == 0) || ((((len <= len && \valid[\old] == 1) && !(cursor == \old)) && len <= len) && unknown-#memory_int-unknown[\old][\old] <= 18446744073709551616 * (unknown-#memory_int-unknown[\old][\old] / 18446744073709551616) + 36028797018963967))) && !(cursor == 0)) && !(cursor == \old))) || (((((((((((((((((((((((((((((cursor == cursor && #memory_$Pointer$[cursor][cursor + 8] == #memory_$Pointer$[\old][\old + 8]) && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && \result <= 1) && \valid[\old] == 1) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && cond / 256 <= 0) && #memory_$Pointer$[cursor][cursor + 8] <= len + #memory_$Pointer$[\old][\old + 8]) && len == unknown-#memory_int-unknown[rv][rv]) && cursor == cursor) && 1 <= cond) && unknown-#memory_int-unknown[cursor][cursor] == 0) && len + #memory_$Pointer$[\old][\old + 8] <= #memory_$Pointer$[cursor][cursor + 8]) && #memory_$Pointer$[rv][8 + rv] == #memory_$Pointer$[\old][\old + 8]) && !(cursor == 0)) && len == unknown-#res!len-unknown) && cursor == cursor) && 1 <= \result) && len == len) && cursor == cursor) && aws_byte_cursor_advance_#res.ptr == #memory_$Pointer$[\old][\old + 8]) && len <= 0) && 0 <= len) && 0 <= len + 9223372036854775808) && unknown-#memory_int-unknown[\old][\old] == 0) && \valid[cursor] == 1) && cursor == 0) && !(rv == 0)) && !(cursor == 0)) && !(cursor == \old)) Killed by 15