./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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_from_array_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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:49:53,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:49:53,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:49:53,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:49:53,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:49:53,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:49:53,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:49:53,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:49:53,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:49:53,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:49:53,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:49:53,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:49:53,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:49:53,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:49:53,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:49:53,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:49:53,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:49:53,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:49:53,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:49:53,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:49:53,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:49:53,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:49:53,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:49:53,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:49:53,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:49:53,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:49:53,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:49:53,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:49:53,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:49:53,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:49:53,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:49:53,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:49:53,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:49:53,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:49:53,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:49:53,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:49:53,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:49:53,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:49:53,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:49:53,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:49:53,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:49:53,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:49:53,559 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:49:53,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:49:53,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:49:53,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:49:53,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:49:53,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:49:53,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:49:53,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:49:53,567 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:49:53,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:49:53,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:49:53,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:49:53,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:49:53,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:49:53,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:49:53,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:49:53,569 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:49:53,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:49:53,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:49:53,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:49:53,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:49:53,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:49:53,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:49:53,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:49:53,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:49:53,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:49:53,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:49:53,570 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:49:53,571 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:49:53,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:49:53,571 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:49:53,571 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2021-11-16 20:49:53,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:49:53,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:49:53,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:49:53,810 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:49:53,812 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:49:53,813 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_from_array_harness.i [2021-11-16 20:49:53,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2523386a/2c8f06e4f93e48f78bbaf49bf98c16f1/FLAGd481d4108 [2021-11-16 20:49:54,474 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:49:54,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-16 20:49:54,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2523386a/2c8f06e4f93e48f78bbaf49bf98c16f1/FLAGd481d4108 [2021-11-16 20:49:54,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2523386a/2c8f06e4f93e48f78bbaf49bf98c16f1 [2021-11-16 20:49:54,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:49:54,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:49:54,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:49:54,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:49:54,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:49:54,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:49:54" (1/1) ... [2021-11-16 20:49:54,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710ab86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:54, skipping insertion in model container [2021-11-16 20:49:54,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:49:54" (1/1) ... [2021-11-16 20:49:54,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:49:54,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:49:55,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-11-16 20:49:55,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-11-16 20:49:55,211 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:49:55,214 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:49:55,727 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,728 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,729 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,729 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,730 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,742 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,749 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,755 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,755 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:55,964 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:49:55,968 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:49:55,969 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:49:55,970 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:49:55,971 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:49:55,971 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:49:55,972 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:49:55,974 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:49:55,974 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:49:55,974 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:49:56,055 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:49:56,145 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,146 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,199 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:49:56,240 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:49:56,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-11-16 20:49:56,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-11-16 20:49:56,260 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:49:56,261 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:49:56,282 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,283 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,283 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,284 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,285 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,289 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,290 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,296 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,296 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,325 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:49:56,326 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:49:56,326 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:49:56,327 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:49:56,327 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:49:56,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:49:56,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:49:56,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:49:56,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:49:56,329 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:49:56,345 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:49:56,378 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,378 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:49:56,394 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:49:56,596 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:49:56,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56 WrapperNode [2021-11-16 20:49:56,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:49:56,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:49:56,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:49:56,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:49:56,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,742 INFO L137 Inliner]: procedures = 692, calls = 2611, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 773 [2021-11-16 20:49:56,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:49:56,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:49:56,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:49:56,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:49:56,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:49:56,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:49:56,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:49:56,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:49:56,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (1/1) ... [2021-11-16 20:49:56,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:49:56,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:49:56,848 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-16 20:49:56,874 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-16 20:49:56,884 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-11-16 20:49:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-11-16 20:49:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:49:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:49:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:49:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:49:56,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:49:56,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:49:56,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:49:56,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:49:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:49:56,887 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:49:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:49:56,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:49:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:49:56,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:49:56,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:49:56,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:49:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 20:49:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 20:49:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:49:56,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:49:57,115 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:49:57,116 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:49:57,941 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:49:57,947 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:49:57,947 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 20:49:57,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:49:57 BoogieIcfgContainer [2021-11-16 20:49:57,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:49:57,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:49:57,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:49:57,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:49:57,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:49:54" (1/3) ... [2021-11-16 20:49:57,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233621b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:49:57, skipping insertion in model container [2021-11-16 20:49:57,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:49:56" (2/3) ... [2021-11-16 20:49:57,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233621b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:49:57, skipping insertion in model container [2021-11-16 20:49:57,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:49:57" (3/3) ... [2021-11-16 20:49:57,954 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-16 20:49:57,958 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:49:57,958 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:49:57,995 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:49:58,003 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-16 20:49:58,003 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:49:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-16 20:49:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-16 20:49:58,025 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:49:58,025 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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-16 20:49:58,026 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:49:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:49:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2021-11-16 20:49:58,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:49:58,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487369916] [2021-11-16 20:49:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:49:58,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:49:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:49:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:49:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:49:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:49:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:49:58,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:49:58,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487369916] [2021-11-16 20:49:58,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487369916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:49:58,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:49:58,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-16 20:49:58,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890008694] [2021-11-16 20:49:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:49:58,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 20:49:58,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:49:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 20:49:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:49:58,507 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:49:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:49:59,200 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-16 20:49:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 20:49:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-11-16 20:49:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:49:59,219 INFO L225 Difference]: With dead ends: 117 [2021-11-16 20:49:59,219 INFO L226 Difference]: Without dead ends: 54 [2021-11-16 20:49:59,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:49:59,223 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:49:59,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 20:49:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-16 20:49:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-16 20:49:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-16 20:49:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-11-16 20:49:59,276 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2021-11-16 20:49:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:49:59,276 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-11-16 20:49:59,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:49:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-11-16 20:49:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-16 20:49:59,278 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:49:59,278 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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-16 20:49:59,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:49:59,278 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:49:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:49:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2021-11-16 20:49:59,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:49:59,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251384933] [2021-11-16 20:49:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:49:59,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:49:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:59,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:49:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:49:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:49:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:49:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:49:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:49:59,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:49:59,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251384933] [2021-11-16 20:49:59,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251384933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:49:59,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:49:59,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:49:59,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729891028] [2021-11-16 20:49:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:49:59,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:49:59,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:49:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:49:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:49:59,513 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:50:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:00,398 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2021-11-16 20:50:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:50:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-11-16 20:50:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:00,401 INFO L225 Difference]: With dead ends: 99 [2021-11-16 20:50:00,401 INFO L226 Difference]: Without dead ends: 57 [2021-11-16 20:50:00,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:50:00,402 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:00,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-16 20:50:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-16 20:50:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-11-16 20:50:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-16 20:50:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2021-11-16 20:50:00,410 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2021-11-16 20:50:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:00,410 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2021-11-16 20:50:00,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-16 20:50:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2021-11-16 20:50:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-16 20:50:00,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:00,412 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 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-16 20:50:00,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-16 20:50:00,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2021-11-16 20:50:00,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:00,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750683320] [2021-11-16 20:50:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:00,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:00,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:50:00,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:00,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750683320] [2021-11-16 20:50:00,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750683320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:00,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:00,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:50:00,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596194074] [2021-11-16 20:50:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:00,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:50:00,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:00,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:50:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:50:00,591 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:00,866 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-11-16 20:50:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:50:00,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2021-11-16 20:50:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:00,868 INFO L225 Difference]: With dead ends: 69 [2021-11-16 20:50:00,868 INFO L226 Difference]: Without dead ends: 67 [2021-11-16 20:50:00,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:50:00,869 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:00,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 287 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:50:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-16 20:50:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-11-16 20:50:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 20:50:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2021-11-16 20:50:00,875 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2021-11-16 20:50:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:00,876 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2021-11-16 20:50:00,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2021-11-16 20:50:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-16 20:50:00,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:00,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 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-16 20:50:00,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-16 20:50:00,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2021-11-16 20:50:00,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:00,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183174242] [2021-11-16 20:50:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:00,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:01,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:50:01,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:01,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183174242] [2021-11-16 20:50:01,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183174242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:01,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:01,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:50:01,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731759492] [2021-11-16 20:50:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:01,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:50:01,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:50:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:50:01,300 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-16 20:50:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:03,652 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2021-11-16 20:50:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:50:03,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2021-11-16 20:50:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:03,654 INFO L225 Difference]: With dead ends: 127 [2021-11-16 20:50:03,654 INFO L226 Difference]: Without dead ends: 78 [2021-11-16 20:50:03,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:50:03,655 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:03,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 262 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-16 20:50:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-16 20:50:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2021-11-16 20:50:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 20:50:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2021-11-16 20:50:03,662 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2021-11-16 20:50:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:03,662 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2021-11-16 20:50:03,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-16 20:50:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2021-11-16 20:50:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-16 20:50:03,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:03,668 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 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-16 20:50:03,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-16 20:50:03,668 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:03,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2021-11-16 20:50:03,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:03,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410294059] [2021-11-16 20:50:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:03,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:50:03,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:03,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410294059] [2021-11-16 20:50:03,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410294059] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:03,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:03,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:50:03,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210430351] [2021-11-16 20:50:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:03,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:50:03,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:50:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:50:03,844 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:05,335 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2021-11-16 20:50:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:50:05,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2021-11-16 20:50:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:05,336 INFO L225 Difference]: With dead ends: 121 [2021-11-16 20:50:05,336 INFO L226 Difference]: Without dead ends: 68 [2021-11-16 20:50:05,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:50:05,337 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:05,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-16 20:50:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-16 20:50:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-16 20:50:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 20:50:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2021-11-16 20:50:05,343 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2021-11-16 20:50:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:05,343 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2021-11-16 20:50:05,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2021-11-16 20:50:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-16 20:50:05,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:05,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:05,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 20:50:05,345 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:05,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2021-11-16 20:50:05,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:05,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509578320] [2021-11-16 20:50:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:05,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:05,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:50:05,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:05,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509578320] [2021-11-16 20:50:05,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509578320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:05,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:05,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:50:05,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106095791] [2021-11-16 20:50:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:05,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:50:05,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:50:05,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:50:05,566 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:07,189 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:07,479 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-11-16 20:50:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:50:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-11-16 20:50:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:07,481 INFO L225 Difference]: With dead ends: 82 [2021-11-16 20:50:07,481 INFO L226 Difference]: Without dead ends: 80 [2021-11-16 20:50:07,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:50:07,481 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:07,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 359 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-16 20:50:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-16 20:50:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2021-11-16 20:50:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 51 states have internal predecessors, (53), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 20:50:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-11-16 20:50:07,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2021-11-16 20:50:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:07,487 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-11-16 20:50:07,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-11-16 20:50:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-16 20:50:07,488 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:07,488 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:07,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 20:50:07,489 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2021-11-16 20:50:07,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:07,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606636690] [2021-11-16 20:50:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:07,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:50:07,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:07,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606636690] [2021-11-16 20:50:07,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606636690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:07,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:07,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 20:50:07,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010104091] [2021-11-16 20:50:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:07,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:50:07,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:50:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:50:07,738 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:09,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:10,072 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-11-16 20:50:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 20:50:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-11-16 20:50:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:10,074 INFO L225 Difference]: With dead ends: 81 [2021-11-16 20:50:10,074 INFO L226 Difference]: Without dead ends: 79 [2021-11-16 20:50:10,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:50:10,075 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:10,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 424 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-16 20:50:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-16 20:50:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-11-16 20:50:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-16 20:50:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-11-16 20:50:10,080 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2021-11-16 20:50:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:10,080 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-11-16 20:50:10,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-16 20:50:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-11-16 20:50:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-16 20:50:10,081 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:10,081 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-16 20:50:10,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 20:50:10,081 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2021-11-16 20:50:10,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:10,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527119274] [2021-11-16 20:50:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:10,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:50:10,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:10,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527119274] [2021-11-16 20:50:10,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527119274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:10,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:10,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:50:10,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275693190] [2021-11-16 20:50:10,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:10,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:50:10,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:50:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:50:10,223 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 20:50:12,248 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:12,444 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-11-16 20:50:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:50:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2021-11-16 20:50:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:12,445 INFO L225 Difference]: With dead ends: 91 [2021-11-16 20:50:12,445 INFO L226 Difference]: Without dead ends: 63 [2021-11-16 20:50:12,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:50:12,446 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:12,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-16 20:50:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-16 20:50:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-16 20:50:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-16 20:50:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-16 20:50:12,449 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2021-11-16 20:50:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:12,450 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-16 20:50:12,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 20:50:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-16 20:50:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-16 20:50:12,450 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:12,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-16 20:50:12,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-16 20:50:12,450 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2021-11-16 20:50:12,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:12,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920554877] [2021-11-16 20:50:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:12,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 20:50:12,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:12,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920554877] [2021-11-16 20:50:12,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920554877] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:12,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:12,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:50:12,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163392973] [2021-11-16 20:50:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:12,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:50:12,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:12,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:50:12,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:50:12,650 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:50:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:13,578 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-11-16 20:50:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:50:13,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2021-11-16 20:50:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:13,579 INFO L225 Difference]: With dead ends: 75 [2021-11-16 20:50:13,579 INFO L226 Difference]: Without dead ends: 73 [2021-11-16 20:50:13,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:50:13,580 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:13,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 279 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-16 20:50:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-16 20:50:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-11-16 20:50:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-16 20:50:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-11-16 20:50:13,588 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2021-11-16 20:50:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:13,588 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-11-16 20:50:13,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:50:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-11-16 20:50:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-16 20:50:13,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:13,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:13,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 20:50:13,592 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2021-11-16 20:50:13,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:13,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926536692] [2021-11-16 20:50:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:13,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 20:50:13,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:13,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926536692] [2021-11-16 20:50:13,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926536692] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:50:13,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504210101] [2021-11-16 20:50:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:13,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:50:13,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:50:13,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:50:13,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 20:50:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:14,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 2382 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-16 20:50:14,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:50:14,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-16 20:50:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-16 20:50:15,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:50:15,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504210101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:50:15,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:50:15,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-11-16 20:50:15,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70717851] [2021-11-16 20:50:15,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 20:50:15,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-16 20:50:15,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-16 20:50:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:50:15,379 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-16 20:50:19,613 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:21,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:21,919 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-11-16 20:50:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-16 20:50:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2021-11-16 20:50:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:21,920 INFO L225 Difference]: With dead ends: 141 [2021-11-16 20:50:21,920 INFO L226 Difference]: Without dead ends: 111 [2021-11-16 20:50:21,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2021-11-16 20:50:21,921 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:21,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 502 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 394 Invalid, 1 Unknown, 311 Unchecked, 6.3s Time] [2021-11-16 20:50:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-16 20:50:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2021-11-16 20:50:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-11-16 20:50:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2021-11-16 20:50:21,927 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 50 [2021-11-16 20:50:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:21,927 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2021-11-16 20:50:21,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-16 20:50:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2021-11-16 20:50:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-16 20:50:21,928 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:21,928 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-16 20:50:21,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-16 20:50:22,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-16 20:50:22,132 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2021-11-16 20:50:22,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:22,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150161427] [2021-11-16 20:50:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:22,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:50:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-16 20:50:22,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:22,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150161427] [2021-11-16 20:50:22,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150161427] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:22,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:22,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:50:22,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897935609] [2021-11-16 20:50:22,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:22,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:50:22,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:22,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:50:22,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:50:22,464 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:50:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:23,556 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-11-16 20:50:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:50:23,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 52 [2021-11-16 20:50:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:23,558 INFO L225 Difference]: With dead ends: 103 [2021-11-16 20:50:23,558 INFO L226 Difference]: Without dead ends: 101 [2021-11-16 20:50:23,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:50:23,558 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:23,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 20:50:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-16 20:50:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-11-16 20:50:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 15 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-11-16 20:50:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-11-16 20:50:23,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 52 [2021-11-16 20:50:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:23,570 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-11-16 20:50:23,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-16 20:50:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-11-16 20:50:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-16 20:50:23,577 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:23,577 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:23,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-16 20:50:23,577 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2021-11-16 20:50:23,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:23,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804542399] [2021-11-16 20:50:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:23,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 20:50:23,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:23,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804542399] [2021-11-16 20:50:23,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804542399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:23,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:23,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-16 20:50:23,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159995188] [2021-11-16 20:50:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:23,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 20:50:23,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 20:50:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:50:23,782 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:50:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:24,428 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-11-16 20:50:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:50:24,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-11-16 20:50:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:24,430 INFO L225 Difference]: With dead ends: 121 [2021-11-16 20:50:24,430 INFO L226 Difference]: Without dead ends: 119 [2021-11-16 20:50:24,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:50:24,430 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:24,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 350 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-16 20:50:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-16 20:50:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-11-16 20:50:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 84 states have internal predecessors, (85), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2021-11-16 20:50:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2021-11-16 20:50:24,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 52 [2021-11-16 20:50:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:24,439 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2021-11-16 20:50:24,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:50:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2021-11-16 20:50:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-16 20:50:24,441 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:24,441 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:24,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-16 20:50:24,441 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2021-11-16 20:50:24,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:24,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963126027] [2021-11-16 20:50:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:24,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-16 20:50:24,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:24,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963126027] [2021-11-16 20:50:24,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963126027] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:24,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:24,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 20:50:24,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654687073] [2021-11-16 20:50:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:24,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:50:24,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:50:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:50:24,680 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:50:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:25,683 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-11-16 20:50:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 20:50:25,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-11-16 20:50:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:25,684 INFO L225 Difference]: With dead ends: 121 [2021-11-16 20:50:25,684 INFO L226 Difference]: Without dead ends: 119 [2021-11-16 20:50:25,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-16 20:50:25,686 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:25,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 425 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-16 20:50:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-16 20:50:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2021-11-16 20:50:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 72 states have internal predecessors, (75), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-11-16 20:50:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-11-16 20:50:25,701 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2021-11-16 20:50:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:25,702 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-11-16 20:50:25,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-16 20:50:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-11-16 20:50:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-16 20:50:25,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:25,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-16 20:50:25,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-16 20:50:25,704 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2021-11-16 20:50:25,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:25,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36553383] [2021-11-16 20:50:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:25,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:50:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:50:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-16 20:50:25,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:25,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36553383] [2021-11-16 20:50:25,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36553383] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:50:25,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915793880] [2021-11-16 20:50:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:25,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:50:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:50:25,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:50:25,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 20:50:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:26,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 2399 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 20:50:26,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:50:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-16 20:50:26,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:50:26,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915793880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:26,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:50:26,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-11-16 20:50:26,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848553577] [2021-11-16 20:50:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:26,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:50:26,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:26,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:50:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:50:26,352 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 20:50:27,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:28,046 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2021-11-16 20:50:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:50:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2021-11-16 20:50:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:28,047 INFO L225 Difference]: With dead ends: 171 [2021-11-16 20:50:28,047 INFO L226 Difference]: Without dead ends: 101 [2021-11-16 20:50:28,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:50:28,048 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:28,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 195 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 18 Unchecked, 1.6s Time] [2021-11-16 20:50:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-16 20:50:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-11-16 20:50:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 72 states have internal predecessors, (73), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-11-16 20:50:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-11-16 20:50:28,056 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 56 [2021-11-16 20:50:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:28,056 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-11-16 20:50:28,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-11-16 20:50:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-11-16 20:50:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-16 20:50:28,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:28,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-16 20:50:28,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-16 20:50:28,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-16 20:50:28,276 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2021-11-16 20:50:28,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:28,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938601225] [2021-11-16 20:50:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:28,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:50:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:50:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-16 20:50:28,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:28,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938601225] [2021-11-16 20:50:28,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938601225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:28,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:28,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:50:28,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399644829] [2021-11-16 20:50:28,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:28,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:50:28,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:50:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:50:28,741 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:50:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:30,578 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-11-16 20:50:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:50:30,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2021-11-16 20:50:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:30,580 INFO L225 Difference]: With dead ends: 127 [2021-11-16 20:50:30,580 INFO L226 Difference]: Without dead ends: 93 [2021-11-16 20:50:30,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:50:30,581 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:30,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 209 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-16 20:50:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-16 20:50:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-11-16 20:50:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 67 states have internal predecessors, (68), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2021-11-16 20:50:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-11-16 20:50:30,585 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 56 [2021-11-16 20:50:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:30,586 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-11-16 20:50:30,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-16 20:50:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-11-16 20:50:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-16 20:50:30,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:30,587 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:30,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-16 20:50:30,587 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2021-11-16 20:50:30,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:30,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090116864] [2021-11-16 20:50:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:30,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:50:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:50:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-16 20:50:30,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:30,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090116864] [2021-11-16 20:50:30,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090116864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:30,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:30,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-16 20:50:30,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484193609] [2021-11-16 20:50:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:30,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 20:50:30,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 20:50:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:50:30,937 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:50:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:31,746 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-11-16 20:50:31,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-16 20:50:31,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2021-11-16 20:50:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:31,748 INFO L225 Difference]: With dead ends: 97 [2021-11-16 20:50:31,748 INFO L226 Difference]: Without dead ends: 93 [2021-11-16 20:50:31,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:50:31,749 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:31,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 218 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 20:50:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-16 20:50:31,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-16 20:50:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2021-11-16 20:50:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-11-16 20:50:31,754 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 59 [2021-11-16 20:50:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:31,754 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-11-16 20:50:31,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-16 20:50:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-11-16 20:50:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-16 20:50:31,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:31,755 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:31,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-16 20:50:31,755 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2021-11-16 20:50:31,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:31,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310181077] [2021-11-16 20:50:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:31,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 20:50:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:50:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:50:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-16 20:50:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-16 20:50:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-16 20:50:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:50:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-16 20:50:32,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:32,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310181077] [2021-11-16 20:50:32,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310181077] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:50:32,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282216096] [2021-11-16 20:50:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:32,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:50:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:50:32,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 20:50:32,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 20:50:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:32,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 2456 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-16 20:50:32,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:50:32,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-16 20:50:33,028 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 20:50:33,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2021-11-16 20:50:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-16 20:50:33,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:50:34,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282216096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:50:34,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:50:34,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-11-16 20:50:34,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081665991] [2021-11-16 20:50:34,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 20:50:34,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-16 20:50:34,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:34,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-16 20:50:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2021-11-16 20:50:34,355 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2021-11-16 20:50:37,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:50:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:38,253 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2021-11-16 20:50:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-16 20:50:38,254 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) Word has length 76 [2021-11-16 20:50:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:38,255 INFO L225 Difference]: With dead ends: 144 [2021-11-16 20:50:38,255 INFO L226 Difference]: Without dead ends: 68 [2021-11-16 20:50:38,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2021-11-16 20:50:38,256 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 79 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:38,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 367 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 445 Invalid, 1 Unknown, 138 Unchecked, 3.6s Time] [2021-11-16 20:50:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-16 20:50:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-16 20:50:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.0) internal successors, (47), 47 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-16 20:50:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-11-16 20:50:38,260 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2021-11-16 20:50:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:38,260 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-11-16 20:50:38,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2021-11-16 20:50:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-11-16 20:50:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-16 20:50:38,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:50:38,261 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:50:38,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 20:50:38,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:50:38,475 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:50:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:50:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2021-11-16 20:50:38,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:50:38,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125903124] [2021-11-16 20:50:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:50:38,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:50:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:50:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:50:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:50:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-16 20:50:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-16 20:50:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:50:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:50:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:50:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 20:50:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 20:50:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 20:50:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:50:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 20:50:39,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:50:39,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125903124] [2021-11-16 20:50:39,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125903124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:50:39,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:50:39,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-16 20:50:39,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142632792] [2021-11-16 20:50:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:50:39,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-16 20:50:39,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:50:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-16 20:50:39,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:50:39,301 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-16 20:50:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:50:40,149 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2021-11-16 20:50:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-16 20:50:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2021-11-16 20:50:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:50:40,149 INFO L225 Difference]: With dead ends: 68 [2021-11-16 20:50:40,150 INFO L226 Difference]: Without dead ends: 0 [2021-11-16 20:50:40,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:50:40,150 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:50:40,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-16 20:50:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-16 20:50:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-16 20:50:40,151 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-16 20:50:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-16 20:50:40,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2021-11-16 20:50:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:50:40,151 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-16 20:50:40,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-16 20:50:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-16 20:50:40,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-16 20:50:40,153 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-16 20:50:40,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-16 20:50:40,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-16 20:50:41,279 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-16 20:50:41,279 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-11-16 20:50:41,279 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,280 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2021-11-16 20:50:41,281 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L854 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|))) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4) 0) .cse5 .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse9) .cse10) (and .cse0 .cse1 (not (= .cse9 0)) .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse3 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse10)))) [2021-11-16 20:50:41,282 INFO L854 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0) 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0)))) [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L854 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2021-11-16 20:50:41,282 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (let ((.cse4 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse7 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse8 (<= .cse13 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse10 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse13)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse12)) (.cse0 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (let ((.cse2 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse3 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (and (or (not .cse0) (and .cse1 .cse2) (not .cse3)) .cse4 .cse5 (not (= .cse6 0)) .cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse9 .cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse11 (or (not .cse1) (not .cse2) (and .cse3 .cse0)))) (and .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse5 .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse8 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse12) 0) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse11 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse0)))) [2021-11-16 20:50:41,282 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse7 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (.cse6 (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse5 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse5)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| .cse7) .cse6)) (.cse4 (<= .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse14)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse13 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse5) 0) (< .cse6 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| .cse7 1)) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse10 .cse11 (= .cse12 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse13) (and .cse0 .cse1 (not (= .cse12 0)) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616))) .cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse3 .cse4 .cse8 .cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse10 .cse11 .cse13)))) [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-11-16 20:50:41,282 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:50:41,282 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-16 20:50:41,283 INFO L854 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse1 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (<= 0 (+ .cse3 (* 18446744073709551616 (div (* .cse3 (- 1)) 18446744073709551616)))) (= .cse3 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|))))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)))) [2021-11-16 20:50:41,283 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-16 20:50:41,283 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-16 20:50:41,283 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-16 20:50:41,283 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-11-16 20:50:41,283 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-11-16 20:50:41,283 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-11-16 20:50:41,283 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:50:41,284 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-11-16 20:50:41,284 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-11-16 20:50:41,284 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8))) (or (and .cse0 .cse1 (not (= .cse2 0)) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse3 (= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse5 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse6 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) 0))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse6) (<= 0 (+ .cse6 (* 18446744073709551616 (div (* .cse6 (- 1)) 18446744073709551616))))))) .cse7) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8) 0) .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse4) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse7 (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2021-11-16 20:50:41,284 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-11-16 20:50:41,284 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse13 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse6 (<= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1| 1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse4)) (.cse12 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13))) (or (and .cse0 .cse1 .cse2 (not (= .cse3 0)) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616))) .cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse12) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse6 .cse7 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13) 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse12 (= .cse3 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2021-11-16 20:50:41,284 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-11-16 20:50:41,284 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-11-16 20:50:41,285 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-16 20:50:41,285 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-16 20:50:41,285 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-16 20:50:41,285 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-16 20:50:41,285 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-16 20:50:41,285 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-16 20:50:41,287 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:50:41,288 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-16 20:50:41,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,296 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,298 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:50:41 BoogieIcfgContainer [2021-11-16 20:50:41,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-16 20:50:41,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-16 20:50:41,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-16 20:50:41,301 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-16 20:50:41,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:49:57" (3/4) ... [2021-11-16 20:50:41,303 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-16 20:50:41,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-11-16 20:50:41,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-11-16 20:50:41,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-11-16 20:50:41,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-16 20:50:41,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-16 20:50:41,315 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-11-16 20:50:41,316 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-16 20:50:41,316 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-16 20:50:41,317 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-16 20:50:41,318 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-16 20:50:41,318 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-16 20:50:41,319 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-16 20:50:41,320 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-16 20:50:41,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && length <= len) && len <= length) && !(cur == 0)) && !(array == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] + 18446744073709551616 * (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] * -1 / 18446744073709551616) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] == unknown-#res!len-unknown)) || ((((((((((unknown-#res!len-unknown <= length && array == 0) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) && length <= unknown-#res!len-unknown) [2021-11-16 20:50:41,948 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-16 20:50:41,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-16 20:50:41,948 INFO L158 Benchmark]: Toolchain (without parser) took 47053.74ms. Allocated memory was 111.1MB in the beginning and 262.1MB in the end (delta: 151.0MB). Free memory was 66.5MB in the beginning and 58.4MB in the end (delta: 8.1MB). Peak memory consumption was 186.6MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,948 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-16 20:50:41,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1701.33ms. Allocated memory was 111.1MB in the beginning and 144.7MB in the end (delta: 33.6MB). Free memory was 66.3MB in the beginning and 74.0MB in the end (delta: -7.7MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.41ms. Allocated memory is still 144.7MB. Free memory was 74.0MB in the beginning and 62.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,949 INFO L158 Benchmark]: Boogie Preprocessor took 78.86ms. Allocated memory is still 144.7MB. Free memory was 62.7MB in the beginning and 56.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,949 INFO L158 Benchmark]: RCFGBuilder took 1126.40ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 56.4MB in the beginning and 104.2MB in the end (delta: -47.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,949 INFO L158 Benchmark]: TraceAbstraction took 43350.28ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 103.4MB in the beginning and 103.1MB in the end (delta: 326.9kB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,950 INFO L158 Benchmark]: Witness Printer took 647.40ms. Allocated memory is still 262.1MB. Free memory was 103.1MB in the beginning and 58.4MB in the end (delta: 44.7MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2021-11-16 20:50:41,951 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1701.33ms. Allocated memory was 111.1MB in the beginning and 144.7MB in the end (delta: 33.6MB). Free memory was 66.3MB in the beginning and 74.0MB in the end (delta: -7.7MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 145.41ms. Allocated memory is still 144.7MB. Free memory was 74.0MB in the beginning and 62.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.86ms. Allocated memory is still 144.7MB. Free memory was 62.7MB in the beginning and 56.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1126.40ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 56.4MB in the beginning and 104.2MB in the end (delta: -47.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43350.28ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 103.4MB in the beginning and 103.1MB in the end (delta: 326.9kB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. * Witness Printer took 647.40ms. Allocated memory is still 262.1MB. Free memory was 103.1MB in the beginning and 58.4MB in the end (delta: 44.7MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1019 SdHoareTripleChecker+Valid, 29.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 966 mSDsluCounter, 4752 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 467 IncrementalHoareTripleChecker+Unchecked, 3701 mSDsCounter, 390 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4689 IncrementalHoareTripleChecker+Invalid, 5549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 390 mSolverCounterUnsat, 1051 mSDtfsCounter, 4689 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 465 SyntacticMatches, 16 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=12, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 88 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 101 PreInvPairs, 125 NumberOfFragments, 1214 HoareAnnotationTreeSize, 101 FomulaSimplifications, 223 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 2125 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1025 ConstructedInterpolants, 44 QuantifiedInterpolants, 4614 SizeOfPredicates, 38 NumberOfNonLiveVariables, 7237 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 320/362 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2021-11-16 20:50:41,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-11-16 20:50:41,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-11-16 20:50:41,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: ((((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && length <= len) && len <= length) && !(cur == 0)) && !(array == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] + 18446744073709551616 * (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] * -1 / 18446744073709551616) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] == unknown-#res!len-unknown)) || ((((((((((unknown-#res!len-unknown <= length && array == 0) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) && length <= unknown-#res!len-unknown) RESULT: Ultimate proved your program to be correct! [2021-11-16 20:50:41,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE