./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8 --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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:49:25,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:49:25,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:49:25,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:49:25,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:49:25,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:49:25,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:49:25,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:49:25,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:49:25,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:49:25,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:49:25,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:49:25,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:49:25,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:49:25,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:49:25,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:49:25,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:49:25,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:49:25,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:49:25,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:49:25,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:49:25,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:49:25,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:49:25,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:49:25,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:49:25,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:49:25,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:49:25,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:49:25,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:49:25,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:49:25,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:49:25,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:49:25,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:49:25,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:49:25,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:49:25,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:49:25,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:49:25,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:49:25,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:49:25,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:49:25,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:49:25,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 12:49:25,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:49:25,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:49:25,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:49:25,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:49:25,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:49:25,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:49:25,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:49:25,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:49:25,525 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:49:25,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:49:25,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:49:25,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:49:25,527 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:49:25,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:49:25,527 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:49:25,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:49:25,527 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:49:25,527 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2022-12-13 12:49:25,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:49:25,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:49:25,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:49:25,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:49:25,712 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:49:25,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-12-13 12:49:28,300 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:49:28,614 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:49:28,614 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-12-13 12:49:28,639 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/data/09a6f8dea/592523e73251462ab57cf69f4a2b7c49/FLAG83c3d9b0f [2022-12-13 12:49:28,653 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/data/09a6f8dea/592523e73251462ab57cf69f4a2b7c49 [2022-12-13 12:49:28,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:49:28,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:49:28,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:49:28,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:49:28,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:49:28,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:28" (1/1) ... [2022-12-13 12:49:28,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376c4c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:28, skipping insertion in model container [2022-12-13 12:49:28,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:28" (1/1) ... [2022-12-13 12:49:28,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:49:28,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:49:28,905 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-12-13 12:49:28,911 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-12-13 12:49:29,547 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,547 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,548 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,548 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,549 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,560 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,560 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,562 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,562 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:29,650 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 12:49:29,650 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 12:49:29,651 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 12:49:29,654 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 12:49:29,656 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 12:49:29,656 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 12:49:29,884 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 12:49:29,885 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 12:49:29,886 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 12:49:29,887 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 12:49:29,887 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 12:49:29,889 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 12:49:29,889 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 12:49:29,890 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 12:49:29,890 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 12:49:29,891 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 12:49:29,891 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 12:49:30,018 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 12:49:30,055 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 12:49:30,066 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 12:49:30,094 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 12:49:30,103 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,104 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,160 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 12:49:30,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:49:30,207 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:49:30,220 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-12-13 12:49:30,221 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-12-13 12:49:30,253 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,253 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,254 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,254 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,255 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,260 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,260 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,261 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,261 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,267 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 12:49:30,268 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 12:49:30,268 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 12:49:30,271 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 12:49:30,272 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 12:49:30,272 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 12:49:30,290 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 12:49:30,291 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 12:49:30,292 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 12:49:30,293 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 12:49:30,293 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 12:49:30,294 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 12:49:30,294 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 12:49:30,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 12:49:30,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 12:49:30,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 12:49:30,296 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 12:49:30,313 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 12:49:30,334 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 12:49:30,340 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 12:49:30,355 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 12:49:30,361 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,361 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 12:49:30,399 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 12:49:30,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:49:30,573 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:49:30,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30 WrapperNode [2022-12-13 12:49:30,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:49:30,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:49:30,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:49:30,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:49:30,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,667 INFO L138 Inliner]: procedures = 690, calls = 2613, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2022-12-13 12:49:30,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:49:30,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:49:30,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:49:30,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:49:30,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,720 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:49:30,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:49:30,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:49:30,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:49:30,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (1/1) ... [2022-12-13 12:49:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:49:30,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:49:30,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:49:30,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:49:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-12-13 12:49:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-12-13 12:49:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:49:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:49:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 12:49:30,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 12:49:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:49:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:49:30,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:49:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:49:30,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:49:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 12:49:30,797 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 12:49:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 12:49:30,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 12:49:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:49:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 12:49:30,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 12:49:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 12:49:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 12:49:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:49:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:49:30,989 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:49:30,991 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:49:31,790 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:49:31,797 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:49:31,797 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:49:31,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:31 BoogieIcfgContainer [2022-12-13 12:49:31,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:49:31,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:49:31,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:49:31,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:49:31,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:49:28" (1/3) ... [2022-12-13 12:49:31,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3002d6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:31, skipping insertion in model container [2022-12-13 12:49:31,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:30" (2/3) ... [2022-12-13 12:49:31,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3002d6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:31, skipping insertion in model container [2022-12-13 12:49:31,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:31" (3/3) ... [2022-12-13 12:49:31,807 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2022-12-13 12:49:31,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:49:31,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:49:31,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:49:31,879 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ab53ac5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:49:31,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:49:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 12:49:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 12:49:31,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:31,889 INFO L195 NwaCegarLoop]: 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] [2022-12-13 12:49:31,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1393308319, now seen corresponding path program 1 times [2022-12-13 12:49:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:31,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650753480] [2022-12-13 12:49:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:32,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:32,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650753480] [2022-12-13 12:49:32,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650753480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:32,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:32,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:49:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820429577] [2022-12-13 12:49:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:49:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:49:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:49:32,390 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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) [2022-12-13 12:49:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:32,550 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2022-12-13 12:49:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:49:32,552 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 [2022-12-13 12:49:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:32,558 INFO L225 Difference]: With dead ends: 133 [2022-12-13 12:49:32,558 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 12:49:32,560 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:32,562 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:32,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 70 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:49:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 12:49:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-13 12:49:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 12:49:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2022-12-13 12:49:32,591 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 29 [2022-12-13 12:49:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:32,592 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2022-12-13 12:49:32,592 INFO L496 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) [2022-12-13 12:49:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-12-13 12:49:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 12:49:32,593 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:32,593 INFO L195 NwaCegarLoop]: 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] [2022-12-13 12:49:32,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:49:32,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 85103393, now seen corresponding path program 1 times [2022-12-13 12:49:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:32,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741555467] [2022-12-13 12:49:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:32,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:33,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741555467] [2022-12-13 12:49:33,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741555467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:33,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:33,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:49:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996424928] [2022-12-13 12:49:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:49:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:49:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:49:33,013 INFO L87 Difference]: Start difference. First operand 62 states and 77 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) [2022-12-13 12:49:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:33,240 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-12-13 12:49:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:49:33,240 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 [2022-12-13 12:49:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:33,243 INFO L225 Difference]: With dead ends: 115 [2022-12-13 12:49:33,243 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 12:49:33,244 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:33,245 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:33,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 135 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 12:49:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-12-13 12:49:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-13 12:49:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2022-12-13 12:49:33,256 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 29 [2022-12-13 12:49:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:33,256 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2022-12-13 12:49:33,256 INFO L496 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) [2022-12-13 12:49:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-12-13 12:49:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 12:49:33,257 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:33,258 INFO L195 NwaCegarLoop]: 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] [2022-12-13 12:49:33,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:49:33,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash -682621012, now seen corresponding path program 1 times [2022-12-13 12:49:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:33,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924073984] [2022-12-13 12:49:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:34,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:34,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924073984] [2022-12-13 12:49:34,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924073984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:34,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:34,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:49:34,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781376828] [2022-12-13 12:49:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:34,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:49:34,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:34,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:49:34,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:49:34,014 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 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) [2022-12-13 12:49:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:34,325 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-12-13 12:49:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:49:34,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 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 [2022-12-13 12:49:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:34,326 INFO L225 Difference]: With dead ends: 77 [2022-12-13 12:49:34,326 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 12:49:34,327 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:34,327 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:34,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 12:49:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-12-13 12:49:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2022-12-13 12:49:34,334 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 35 [2022-12-13 12:49:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:34,334 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2022-12-13 12:49:34,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 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) [2022-12-13 12:49:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2022-12-13 12:49:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:49:34,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:34,336 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:34,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:49:34,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 834697204, now seen corresponding path program 1 times [2022-12-13 12:49:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:34,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452041868] [2022-12-13 12:49:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:35,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:35,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452041868] [2022-12-13 12:49:35,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452041868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:35,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:35,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 12:49:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423360910] [2022-12-13 12:49:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:35,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:49:35,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:35,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:49:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:49:35,248 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-12-13 12:49:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:35,570 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2022-12-13 12:49:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:49:35,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 39 [2022-12-13 12:49:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:35,572 INFO L225 Difference]: With dead ends: 156 [2022-12-13 12:49:35,572 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 12:49:35,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:49:35,573 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:35,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 147 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:49:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 12:49:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-12-13 12:49:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-12-13 12:49:35,581 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 39 [2022-12-13 12:49:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:35,581 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-12-13 12:49:35,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) [2022-12-13 12:49:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-12-13 12:49:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:49:35,582 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:35,582 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:35,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:49:35,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1092862642, now seen corresponding path program 1 times [2022-12-13 12:49:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:35,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956685372] [2022-12-13 12:49:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:37,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956685372] [2022-12-13 12:49:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956685372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:49:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541417586] [2022-12-13 12:49:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:49:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:49:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:49:38,271 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2022-12-13 12:49:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:39,203 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-12-13 12:49:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:49:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 39 [2022-12-13 12:49:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:39,205 INFO L225 Difference]: With dead ends: 168 [2022-12-13 12:49:39,205 INFO L226 Difference]: Without dead ends: 106 [2022-12-13 12:49:39,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-12-13 12:49:39,206 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 177 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:39,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 136 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:49:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-13 12:49:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-12-13 12:49:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.203125) internal successors, (77), 67 states have internal predecessors, (77), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-12-13 12:49:39,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 39 [2022-12-13 12:49:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:39,214 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-12-13 12:49:39,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2022-12-13 12:49:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-12-13 12:49:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:49:39,215 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:39,216 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:39,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:49:39,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -187001036, now seen corresponding path program 1 times [2022-12-13 12:49:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:39,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921247104] [2022-12-13 12:49:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:39,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921247104] [2022-12-13 12:49:39,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921247104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:39,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:39,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:49:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497994827] [2022-12-13 12:49:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:39,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:49:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:39,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:49:39,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:49:39,809 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2022-12-13 12:49:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:40,106 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-12-13 12:49:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:49:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 39 [2022-12-13 12:49:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:40,108 INFO L225 Difference]: With dead ends: 180 [2022-12-13 12:49:40,108 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 12:49:40,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:49:40,109 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 113 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:40,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 163 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 12:49:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2022-12-13 12:49:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2022-12-13 12:49:40,116 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 39 [2022-12-13 12:49:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:40,116 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2022-12-13 12:49:40,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2022-12-13 12:49:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2022-12-13 12:49:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:49:40,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:40,117 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:40,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:49:40,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -753650698, now seen corresponding path program 1 times [2022-12-13 12:49:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:40,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29182247] [2022-12-13 12:49:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:40,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29182247] [2022-12-13 12:49:40,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29182247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:40,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:40,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:49:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047805007] [2022-12-13 12:49:40,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:40,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:49:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:40,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:49:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:49:40,289 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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) [2022-12-13 12:49:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:40,440 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2022-12-13 12:49:40,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:49:40,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 39 [2022-12-13 12:49:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:40,441 INFO L225 Difference]: With dead ends: 172 [2022-12-13 12:49:40,441 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 12:49:40,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:49:40,442 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:40,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 116 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:49:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 12:49:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2022-12-13 12:49:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 66 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2022-12-13 12:49:40,448 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 39 [2022-12-13 12:49:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:40,448 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-12-13 12:49:40,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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) [2022-12-13 12:49:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-12-13 12:49:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:49:40,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:40,449 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:40,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:49:40,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2033514376, now seen corresponding path program 1 times [2022-12-13 12:49:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86224816] [2022-12-13 12:49:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86224816] [2022-12-13 12:49:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86224816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:41,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:41,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:49:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036979466] [2022-12-13 12:49:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:41,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:49:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:41,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:49:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:49:41,017 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-12-13 12:49:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:41,239 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2022-12-13 12:49:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:49:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 39 [2022-12-13 12:49:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:41,240 INFO L225 Difference]: With dead ends: 169 [2022-12-13 12:49:41,241 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 12:49:41,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:49:41,242 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 142 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 12:49:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2022-12-13 12:49:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.2) internal successors, (78), 68 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2022-12-13 12:49:41,248 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 39 [2022-12-13 12:49:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:41,248 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2022-12-13 12:49:41,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-12-13 12:49:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-12-13 12:49:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:49:41,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:41,249 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:41,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:49:41,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1775348938, now seen corresponding path program 1 times [2022-12-13 12:49:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:41,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770273981] [2022-12-13 12:49:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:41,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770273981] [2022-12-13 12:49:41,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770273981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:41,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:41,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:49:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581988844] [2022-12-13 12:49:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:41,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:49:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:49:41,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:49:41,583 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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) [2022-12-13 12:49:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:41,770 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-12-13 12:49:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:49:41,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 39 [2022-12-13 12:49:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:41,771 INFO L225 Difference]: With dead ends: 168 [2022-12-13 12:49:41,771 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 12:49:41,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:49:41,772 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 60 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:41,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 111 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 12:49:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-12-13 12:49:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 66 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2022-12-13 12:49:41,777 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 39 [2022-12-13 12:49:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:41,778 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2022-12-13 12:49:41,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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) [2022-12-13 12:49:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-12-13 12:49:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 12:49:41,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:41,779 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 12:49:41,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:49:41,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:41,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1543914243, now seen corresponding path program 1 times [2022-12-13 12:49:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:41,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894534157] [2022-12-13 12:49:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:42,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:42,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894534157] [2022-12-13 12:49:42,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894534157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:42,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:42,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:49:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509586502] [2022-12-13 12:49:42,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:49:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:49:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:49:42,245 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 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) [2022-12-13 12:49:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:42,496 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-12-13 12:49:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:49:42,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 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 41 [2022-12-13 12:49:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:42,497 INFO L225 Difference]: With dead ends: 109 [2022-12-13 12:49:42,497 INFO L226 Difference]: Without dead ends: 107 [2022-12-13 12:49:42,497 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:42,498 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 70 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:42,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-13 12:49:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-12-13 12:49:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-12-13 12:49:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-12-13 12:49:42,503 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2022-12-13 12:49:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:42,503 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-12-13 12:49:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 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) [2022-12-13 12:49:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-12-13 12:49:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 12:49:42,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:42,504 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 12:49:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:49:42,505 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash -842849665, now seen corresponding path program 1 times [2022-12-13 12:49:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:42,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823733464] [2022-12-13 12:49:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823733464] [2022-12-13 12:49:43,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823733464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:43,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:43,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:49:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436192200] [2022-12-13 12:49:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:43,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:49:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:49:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:49:43,035 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2022-12-13 12:49:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:43,231 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2022-12-13 12:49:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:49:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 41 [2022-12-13 12:49:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:43,232 INFO L225 Difference]: With dead ends: 171 [2022-12-13 12:49:43,232 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 12:49:43,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:49:43,233 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 56 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:43,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 163 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 12:49:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-12-13 12:49:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 62 states have internal predecessors, (71), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-13 12:49:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-12-13 12:49:43,237 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 41 [2022-12-13 12:49:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:43,237 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-12-13 12:49:43,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2022-12-13 12:49:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-12-13 12:49:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:49:43,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:43,238 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-12-13 12:49:43,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:49:43,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash -143563596, now seen corresponding path program 1 times [2022-12-13 12:49:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:43,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988524057] [2022-12-13 12:49:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:49:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:43,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988524057] [2022-12-13 12:49:43,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988524057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:43,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:43,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:49:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109469721] [2022-12-13 12:49:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:43,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:49:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:43,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:49:43,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:49:43,449 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-12-13 12:49:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:43,586 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-12-13 12:49:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:49:43,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 48 [2022-12-13 12:49:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:43,587 INFO L225 Difference]: With dead ends: 114 [2022-12-13 12:49:43,587 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 12:49:43,588 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:43,588 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 105 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:49:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 12:49:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-12-13 12:49:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-12-13 12:49:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-12-13 12:49:43,592 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 48 [2022-12-13 12:49:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:43,592 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-12-13 12:49:43,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-12-13 12:49:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-12-13 12:49:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 12:49:43,593 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:43,593 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-12-13 12:49:43,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:49:43,593 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1027849983, now seen corresponding path program 1 times [2022-12-13 12:49:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:43,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631818690] [2022-12-13 12:49:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 12:49:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:43,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631818690] [2022-12-13 12:49:43,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631818690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:43,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:43,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:49:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074793715] [2022-12-13 12:49:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:43,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:49:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:49:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:49:43,974 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 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) [2022-12-13 12:49:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:44,177 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-12-13 12:49:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:49:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 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 54 [2022-12-13 12:49:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:44,178 INFO L225 Difference]: With dead ends: 98 [2022-12-13 12:49:44,178 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 12:49:44,178 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:44,179 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 59 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:44,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 226 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 12:49:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-12-13 12:49:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-12-13 12:49:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2022-12-13 12:49:44,183 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 54 [2022-12-13 12:49:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:44,183 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2022-12-13 12:49:44,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 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) [2022-12-13 12:49:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2022-12-13 12:49:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:49:44,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:44,184 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-13 12:49:44,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:49:44,184 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1667671931, now seen corresponding path program 1 times [2022-12-13 12:49:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92560087] [2022-12-13 12:49:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:44,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:49:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92560087] [2022-12-13 12:49:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92560087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:49:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837207808] [2022-12-13 12:49:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:49:45,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:49:45,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:49:45,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:49:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:46,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 12:49:46,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:49:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:47,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:49:47,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837207808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:49:47,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:49:47,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-12-13 12:49:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127377999] [2022-12-13 12:49:47,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:49:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 12:49:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 12:49:47,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2022-12-13 12:49:47,579 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-13 12:49:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:49,710 INFO L93 Difference]: Finished difference Result 242 states and 287 transitions. [2022-12-13 12:49:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 12:49:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 58 [2022-12-13 12:49:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:49,711 INFO L225 Difference]: With dead ends: 242 [2022-12-13 12:49:49,711 INFO L226 Difference]: Without dead ends: 203 [2022-12-13 12:49:49,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=373, Invalid=1979, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 12:49:49,712 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 293 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:49,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 191 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 12:49:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-13 12:49:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 158. [2022-12-13 12:49:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.146551724137931) internal successors, (133), 121 states have internal predecessors, (133), 25 states have call successors, (25), 12 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-12-13 12:49:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2022-12-13 12:49:49,721 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 58 [2022-12-13 12:49:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:49,721 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2022-12-13 12:49:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-13 12:49:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2022-12-13 12:49:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:49:49,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:49,722 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 12:49:49,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:49:49,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 12:49:49,924 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1347431687, now seen corresponding path program 1 times [2022-12-13 12:49:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:49,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592812409] [2022-12-13 12:49:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:49:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592812409] [2022-12-13 12:49:50,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592812409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:50,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:50,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:49:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100319723] [2022-12-13 12:49:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:49:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:49:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:49:50,714 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:49:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:51,084 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2022-12-13 12:49:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:49:51,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-12-13 12:49:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:51,086 INFO L225 Difference]: With dead ends: 250 [2022-12-13 12:49:51,086 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 12:49:51,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:49:51,087 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 109 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:51,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 131 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:49:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 12:49:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2022-12-13 12:49:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 112 states have internal predecessors, (121), 25 states have call successors, (25), 12 states have call predecessors, (25), 15 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-12-13 12:49:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2022-12-13 12:49:51,096 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 58 [2022-12-13 12:49:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:51,096 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2022-12-13 12:49:51,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:49:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2022-12-13 12:49:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:49:51,097 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:51,097 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 12:49:51,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:49:51,097 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -499081653, now seen corresponding path program 1 times [2022-12-13 12:49:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:51,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375113448] [2022-12-13 12:49:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:49:51,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:51,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375113448] [2022-12-13 12:49:51,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375113448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:51,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:51,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:49:51,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122780658] [2022-12-13 12:49:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:51,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:49:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:49:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:49:51,804 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:49:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:52,116 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2022-12-13 12:49:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 12:49:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-12-13 12:49:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:52,117 INFO L225 Difference]: With dead ends: 219 [2022-12-13 12:49:52,117 INFO L226 Difference]: Without dead ends: 153 [2022-12-13 12:49:52,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:49:52,118 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:52,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 121 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-13 12:49:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2022-12-13 12:49:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.1018518518518519) internal successors, (119), 112 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 15 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-12-13 12:49:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2022-12-13 12:49:52,125 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 58 [2022-12-13 12:49:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:52,125 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2022-12-13 12:49:52,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:49:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2022-12-13 12:49:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 12:49:52,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:52,126 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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] [2022-12-13 12:49:52,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:49:52,126 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash 592257393, now seen corresponding path program 1 times [2022-12-13 12:49:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:52,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806326040] [2022-12-13 12:49:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:49:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 12:49:52,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:52,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806326040] [2022-12-13 12:49:52,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806326040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:52,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:52,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:49:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413235095] [2022-12-13 12:49:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:52,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:49:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:49:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:49:52,715 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 12:49:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:52,962 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2022-12-13 12:49:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:49:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2022-12-13 12:49:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:52,964 INFO L225 Difference]: With dead ends: 159 [2022-12-13 12:49:52,964 INFO L226 Difference]: Without dead ends: 157 [2022-12-13 12:49:52,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:49:52,964 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:52,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-13 12:49:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-12-13 12:49:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 118 states have internal predecessors, (125), 25 states have call successors, (25), 14 states have call predecessors, (25), 17 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-12-13 12:49:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2022-12-13 12:49:52,973 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 60 [2022-12-13 12:49:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:52,973 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2022-12-13 12:49:52,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 12:49:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2022-12-13 12:49:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 12:49:52,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:52,974 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 12:49:52,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:49:52,974 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:52,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash 506399248, now seen corresponding path program 1 times [2022-12-13 12:49:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:52,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441354215] [2022-12-13 12:49:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 12:49:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441354215] [2022-12-13 12:49:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441354215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:53,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:53,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 12:49:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621551423] [2022-12-13 12:49:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:53,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:49:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:49:53,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:49:53,430 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-12-13 12:49:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:53,696 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2022-12-13 12:49:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:49:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 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 60 [2022-12-13 12:49:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:53,697 INFO L225 Difference]: With dead ends: 183 [2022-12-13 12:49:53,697 INFO L226 Difference]: Without dead ends: 181 [2022-12-13 12:49:53,697 INFO L412 NwaCegarLoop]: 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 [2022-12-13 12:49:53,698 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:53,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 286 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-13 12:49:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2022-12-13 12:49:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 124 states have (on average 1.0887096774193548) internal successors, (135), 129 states have internal predecessors, (135), 26 states have call successors, (26), 15 states have call predecessors, (26), 19 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2022-12-13 12:49:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2022-12-13 12:49:53,705 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 60 [2022-12-13 12:49:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:53,706 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2022-12-13 12:49:53,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-12-13 12:49:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2022-12-13 12:49:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 12:49:53,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:53,706 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 12:49:53,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:49:53,706 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1207463826, now seen corresponding path program 1 times [2022-12-13 12:49:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:53,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322337299] [2022-12-13 12:49:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:49:54,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:54,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322337299] [2022-12-13 12:49:54,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322337299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:54,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:54,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:49:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712080593] [2022-12-13 12:49:54,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:54,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:49:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:49:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:49:54,500 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:49:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:54,766 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2022-12-13 12:49:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:49:54,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-12-13 12:49:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:54,768 INFO L225 Difference]: With dead ends: 240 [2022-12-13 12:49:54,768 INFO L226 Difference]: Without dead ends: 164 [2022-12-13 12:49:54,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:49:54,768 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:54,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 100 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-13 12:49:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2022-12-13 12:49:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.0677966101694916) internal successors, (126), 122 states have internal predecessors, (126), 25 states have call successors, (25), 15 states have call predecessors, (25), 18 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-12-13 12:49:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2022-12-13 12:49:54,779 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 60 [2022-12-13 12:49:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:54,779 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2022-12-13 12:49:54,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:49:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-12-13 12:49:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 12:49:54,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:54,780 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-12-13 12:49:54,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:49:54,780 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1397895009, now seen corresponding path program 1 times [2022-12-13 12:49:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:54,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124574885] [2022-12-13 12:49:54,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:49:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:49:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:49:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 12:49:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 12:49:55,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:55,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124574885] [2022-12-13 12:49:55,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124574885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:49:55,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:49:55,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:49:55,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238957701] [2022-12-13 12:49:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:49:55,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:49:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:49:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:49:55,422 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 12:49:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:49:55,719 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-12-13 12:49:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:49:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-12-13 12:49:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:49:55,720 INFO L225 Difference]: With dead ends: 172 [2022-12-13 12:49:55,721 INFO L226 Difference]: Without dead ends: 170 [2022-12-13 12:49:55,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:49:55,721 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:49:55,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 118 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:49:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-13 12:49:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-12-13 12:49:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 124 states have (on average 1.064516129032258) internal successors, (132), 128 states have internal predecessors, (132), 25 states have call successors, (25), 17 states have call predecessors, (25), 20 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-12-13 12:49:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2022-12-13 12:49:55,736 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 66 [2022-12-13 12:49:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:49:55,736 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2022-12-13 12:49:55,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 12:49:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-12-13 12:49:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 12:49:55,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:49:55,737 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 12:49:55,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:49:55,738 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:49:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:49:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2018654228, now seen corresponding path program 1 times [2022-12-13 12:49:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:49:55,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296607134] [2022-12-13 12:49:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:49:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:49:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:49:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:49:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:49:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 12:49:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:49:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:49:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:49:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296607134] [2022-12-13 12:49:58,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296607134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:49:58,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617079177] [2022-12-13 12:49:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:49:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:49:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:49:58,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:49:58,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:49:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:49:58,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 12:49:58,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:49:58,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:49:58,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:49:58,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 12:49:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 12:49:59,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:49:59,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617079177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:49:59,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:49:59,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2022-12-13 12:49:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890530783] [2022-12-13 12:49:59,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:49:59,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 12:49:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:49:59,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 12:49:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 12:49:59,975 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 31 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 12:50:02,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:50:06,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 12:50:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:50:08,769 INFO L93 Difference]: Finished difference Result 396 states and 423 transitions. [2022-12-13 12:50:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 12:50:08,770 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 64 [2022-12-13 12:50:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:50:08,771 INFO L225 Difference]: With dead ends: 396 [2022-12-13 12:50:08,771 INFO L226 Difference]: Without dead ends: 269 [2022-12-13 12:50:08,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=413, Invalid=4009, Unknown=0, NotChecked=0, Total=4422 [2022-12-13 12:50:08,773 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 312 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 191 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:50:08,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 365 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2590 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-12-13 12:50:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-13 12:50:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 204. [2022-12-13 12:50:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 154 states have (on average 1.051948051948052) internal successors, (162), 158 states have internal predecessors, (162), 26 states have call successors, (26), 20 states have call predecessors, (26), 23 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-12-13 12:50:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions. [2022-12-13 12:50:08,805 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 215 transitions. Word has length 64 [2022-12-13 12:50:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:50:08,805 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 215 transitions. [2022-12-13 12:50:08,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 12:50:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 215 transitions. [2022-12-13 12:50:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 12:50:08,806 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:50:08,806 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1] [2022-12-13 12:50:08,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:50:09,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:50:09,008 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:50:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:50:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash -134753713, now seen corresponding path program 1 times [2022-12-13 12:50:09,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:50:09,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742404574] [2022-12-13 12:50:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:50:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:50:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:50:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:50:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:50:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:50:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:50:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:50:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 12:50:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:50:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 12:50:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:50:09,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742404574] [2022-12-13 12:50:09,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742404574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:50:09,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:50:09,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:50:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362034103] [2022-12-13 12:50:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:50:09,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:50:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:50:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:50:09,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:50:09,643 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 12:50:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:50:09,980 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2022-12-13 12:50:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:50:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-12-13 12:50:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:50:09,982 INFO L225 Difference]: With dead ends: 214 [2022-12-13 12:50:09,982 INFO L226 Difference]: Without dead ends: 212 [2022-12-13 12:50:09,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:50:09,982 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:50:09,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 129 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 12:50:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-13 12:50:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-12-13 12:50:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 160 states have (on average 1.05) internal successors, (168), 164 states have internal predecessors, (168), 26 states have call successors, (26), 22 states have call predecessors, (26), 25 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-12-13 12:50:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2022-12-13 12:50:10,014 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 72 [2022-12-13 12:50:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:50:10,014 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2022-12-13 12:50:10,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 12:50:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2022-12-13 12:50:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 12:50:10,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:50:10,016 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:50:10,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 12:50:10,016 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:50:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:50:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1256277667, now seen corresponding path program 1 times [2022-12-13 12:50:10,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:50:10,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132007465] [2022-12-13 12:50:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:50:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:50:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:50:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:50:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:50:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:50:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:50:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:50:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 12:50:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:50:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 12:50:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 12:50:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:50:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132007465] [2022-12-13 12:50:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132007465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:50:10,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:50:10,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:50:10,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069417771] [2022-12-13 12:50:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:50:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:50:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:50:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:50:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:50:10,895 INFO L87 Difference]: Start difference. First operand 212 states and 221 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 12:50:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:50:11,166 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2022-12-13 12:50:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:50:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2022-12-13 12:50:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:50:11,167 INFO L225 Difference]: With dead ends: 222 [2022-12-13 12:50:11,167 INFO L226 Difference]: Without dead ends: 216 [2022-12-13 12:50:11,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:50:11,168 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:50:11,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:50:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-13 12:50:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2022-12-13 12:50:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.0372670807453417) internal successors, (167), 164 states have internal predecessors, (167), 25 states have call successors, (25), 23 states have call predecessors, (25), 25 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-12-13 12:50:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 219 transitions. [2022-12-13 12:50:11,190 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 219 transitions. Word has length 79 [2022-12-13 12:50:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:50:11,190 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 219 transitions. [2022-12-13 12:50:11,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 12:50:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 219 transitions. [2022-12-13 12:50:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 12:50:11,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:50:11,191 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 12:50:11,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:50:11,191 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:50:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:50:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 195550462, now seen corresponding path program 1 times [2022-12-13 12:50:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:50:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934993568] [2022-12-13 12:50:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:50:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:50:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:11,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:50:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:50:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:50:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:50:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 12:50:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 12:50:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 12:50:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:50:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 12:50:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 12:50:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 12:50:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 12:50:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 12:50:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:50:12,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934993568] [2022-12-13 12:50:12,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934993568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:50:12,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877102642] [2022-12-13 12:50:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:12,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:50:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:50:12,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:50:12,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:50:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:12,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 2580 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 12:50:12,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:50:13,085 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:50:13,085 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 10 [2022-12-13 12:50:13,088 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:50:13,088 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 10 [2022-12-13 12:50:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 12:50:13,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:50:13,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877102642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:50:13,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:50:13,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-12-13 12:50:13,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772435514] [2022-12-13 12:50:13,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:50:13,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 12:50:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:50:13,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 12:50:13,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-12-13 12:50:13,288 INFO L87 Difference]: Start difference. First operand 212 states and 219 transitions. Second operand has 17 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2022-12-13 12:50:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:50:14,485 INFO L93 Difference]: Finished difference Result 249 states and 255 transitions. [2022-12-13 12:50:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 12:50:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) Word has length 96 [2022-12-13 12:50:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:50:14,486 INFO L225 Difference]: With dead ends: 249 [2022-12-13 12:50:14,486 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 12:50:14,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 168 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 12:50:14,487 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:50:14,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 222 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 12:50:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 12:50:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-13 12:50:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.0) internal successors, (75), 75 states have internal predecessors, (75), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-13 12:50:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-12-13 12:50:14,497 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 96 [2022-12-13 12:50:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:50:14,498 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-12-13 12:50:14,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2022-12-13 12:50:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-12-13 12:50:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-13 12:50:14,498 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:50:14,499 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:50:14,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 12:50:14,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 12:50:14,700 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:50:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:50:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1936668706, now seen corresponding path program 1 times [2022-12-13 12:50:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:50:14,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747345089] [2022-12-13 12:50:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:50:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:50:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:50:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 12:50:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 12:50:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 12:50:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-12-13 12:50:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:50:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 12:50:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 12:50:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 12:50:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 12:50:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 12:50:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 12:50:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 12:50:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:50:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 12:50:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:50:16,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747345089] [2022-12-13 12:50:16,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747345089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:50:16,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:50:16,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 12:50:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571417087] [2022-12-13 12:50:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:50:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:50:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:50:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:50:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-12-13 12:50:16,919 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-12-13 12:50:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:50:17,624 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-12-13 12:50:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:50:17,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 108 [2022-12-13 12:50:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:50:17,625 INFO L225 Difference]: With dead ends: 101 [2022-12-13 12:50:17,625 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:50:17,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-12-13 12:50:17,625 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:50:17,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 156 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 12:50:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:50:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:50:17,626 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) [2022-12-13 12:50:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:50:17,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2022-12-13 12:50:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:50:17,626 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:50:17,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-12-13 12:50:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:50:17,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:50:17,628 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:50:17,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 12:50:17,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:50:22,518 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-12-13 12:50:22,518 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 12:50:22,518 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-12-13 12:50:22,518 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7375 7381) the Hoare annotation is: true [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,519 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-12-13 12:50:22,520 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-12-13 12:50:22,521 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2022-12-13 12:50:22,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:50:22,521 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-12-13 12:50:22,521 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2022-12-13 12:50:22,521 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (not (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2022-12-13 12:50:22,521 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-12-13 12:50:22,521 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-12-13 12:50:22,522 INFO L895 garLoopResultBuilder]: At program point aws_byte_buf_from_empty_array_returnLabel#1(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse1 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse3 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse3) (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse4 0)))) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse9 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse11 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse11) (not (= (mod .cse11 18446744073709551616) 0)))))))) [2022-12-13 12:50:22,522 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:50:22,522 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8))) (let ((.cse4 (select .cse0 .cse8)) (.cse5 (= (select .cse3 .cse8) 0)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24)) (.cse7 (select .cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse6 (and (= .cse4 0) .cse5))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= 0 (select .cse0 .cse1)) (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse3 .cse1) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (or (and (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5) .cse6) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (or (<= .cse7 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)))) .cse6) (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2022-12-13 12:50:22,522 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 8976) the Hoare annotation is: true [2022-12-13 12:50:22,522 INFO L895 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (not (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0))) [2022-12-13 12:50:22,522 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2022-12-13 12:50:22,522 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0)) (.cse3 (= (select .cse19 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (and .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse9 (select .cse21 .cse22)) (.cse10 (= (select .cse21 .cse20) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse16 (= 0 (select .cse19 .cse20))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse18) (not (= (mod .cse18 18446744073709551616) 0)))))) (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse3 .cse4 .cse7 .cse8 (or .cse5 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse9 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2022-12-13 12:50:22,523 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-12-13 12:50:22,523 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2022-12-13 12:50:22,523 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-12-13 12:50:22,523 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2022-12-13 12:50:22,523 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse18 .cse21) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (and .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse4 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse7 (select .cse20 .cse21)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1202#1| 0)) (.cse9 (= (select .cse20 .cse19) 0)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse13 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse14 (= 0 (select .cse18 .cse19))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse3 .cse4 .cse5 (or .cse6 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (or .cse6 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse16)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse17 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse17) (not (= (mod .cse17 18446744073709551616) 0))))))))) [2022-12-13 12:50:22,524 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse0 (select .cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse2 (= 0 (select .cse19 .cse17))) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1| 1)) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1|)) (.cse3 (select .cse19 .cse16)) (.cse6 (= (select .cse18 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse7 (= (select .cse15 .cse17) 0)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse12 (= (select .cse15 .cse16) 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) .cse1 .cse2 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 .cse5 .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse4 .cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= .cse3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2022-12-13 12:50:22,524 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1201#1|)) (.cse3 (= (select .cse19 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (and .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse9 (select .cse21 .cse22)) (.cse10 (= (select .cse21 .cse20) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse15 (= 0 (select .cse19 .cse20))) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1201#1| 1)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse18) (not (= (mod .cse18 18446744073709551616) 0)))))) (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse3 .cse4 .cse7 .cse8 (or .cse5 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse9 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2022-12-13 12:50:22,525 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse22 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (= (select .cse20 .cse26) 0)) (.cse24 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse25 (select .cse22 .cse26))) (let ((.cse2 (= .cse25 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse0 (and .cse1 .cse24 (= .cse25 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_assert_bytes_match_#t~mem585#1| |ULTIMATE.start_assert_bytes_match_#t~mem584#1|) (or .cse0 (and .cse1 .cse2)) (let ((.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse4 (= (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse10 (= (select .cse22 .cse21) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse15 (= 0 (select .cse20 .cse21))) (.cse16 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse19 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse19) (not (= (mod .cse19 18446744073709551616) 0))))))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or (and .cse9 .cse18) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9)) .cse24 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse0))))) [2022-12-13 12:50:22,525 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2022-12-13 12:50:22,525 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-12-13 12:50:22,525 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse18 .cse21) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1203#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (and .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse9 (select .cse20 .cse21)) (.cse10 (= (select .cse20 .cse19) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse15 (= 0 (select .cse18 .cse19))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or .cse4 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 .cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse17 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse17) (not (= (mod .cse17 18446744073709551616) 0)))))) (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse3 .cse6 .cse7 .cse8 (or .cse4 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse9 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-12-13 12:50:22,525 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-12-13 12:50:22,526 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse21 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse25 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse25 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= (select .cse25 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (= (select .cse24 .cse22) 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse8 (select .cse24 .cse23)) (.cse9 (select .cse21 .cse23)) (.cse16 (= 0 (select .cse21 .cse22))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse3 .cse4 .cse5 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse6 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse6 0) (= .cse7 .cse8) (= .cse6 .cse9) (= .cse7 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse10 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse10) (= .cse11 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse11 0)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (let ((.cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse18))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse5 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (let ((.cse19 (= .cse9 0))) (or (and .cse19 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse19 (= .cse8 0)))) .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse20 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse20) (not (= (mod .cse20 18446744073709551616) 0))))))))) [2022-12-13 12:50:22,526 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-12-13 12:50:22,526 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-12-13 12:50:22,526 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-12-13 12:50:22,526 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-12-13 12:50:22,526 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-12-13 12:50:22,526 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2022-12-13 12:50:22,526 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-12-13 12:50:22,528 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:50:22,530 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:50:22,536 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,537 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,537 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,537 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,538 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,539 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,540 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,540 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,542 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,542 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,542 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,543 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:50:22 BoogieIcfgContainer [2022-12-13 12:50:22,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:50:22,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:50:22,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:50:22,547 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:50:22,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:31" (3/4) ... [2022-12-13 12:50:22,549 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:50:22,553 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-12-13 12:50:22,553 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-12-13 12:50:22,553 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-12-13 12:50:22,554 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 12:50:22,554 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 12:50:22,560 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-12-13 12:50:22,561 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-12-13 12:50:22,561 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-12-13 12:50:22,562 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 12:50:22,562 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 12:50:22,563 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 12:50:22,563 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:50:22,564 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:50:22,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == aws_byte_buf_from_empty_array_#res#1.buffer) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && buf == 0) || (((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (aws_byte_buf_from_empty_array_#res#1.buffer == array && aws_byte_buf_from_empty_array_#res#1.buffer == 0))) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && !(bytes == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && bytes == 0) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) [2022-12-13 12:50:22,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:50:22,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:50:22,906 INFO L158 Benchmark]: Toolchain (without parser) took 54249.91ms. Allocated memory was 142.6MB in the beginning and 627.0MB in the end (delta: 484.4MB). Free memory was 102.5MB in the beginning and 284.7MB in the end (delta: -182.2MB). Peak memory consumption was 303.8MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,906 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:50:22,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1915.38ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 102.5MB in the beginning and 105.8MB in the end (delta: -3.3MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.90ms. Allocated memory is still 172.0MB. Free memory was 105.8MB in the beginning and 94.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,907 INFO L158 Benchmark]: Boogie Preprocessor took 64.06ms. Allocated memory is still 172.0MB. Free memory was 94.3MB in the beginning and 88.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,907 INFO L158 Benchmark]: RCFGBuilder took 1066.36ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 88.0MB in the beginning and 94.3MB in the end (delta: -6.3MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,907 INFO L158 Benchmark]: TraceAbstraction took 50745.03ms. Allocated memory was 207.6MB in the beginning and 627.0MB in the end (delta: 419.4MB). Free memory was 93.3MB in the beginning and 414.7MB in the end (delta: -321.5MB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,907 INFO L158 Benchmark]: Witness Printer took 359.66ms. Allocated memory is still 627.0MB. Free memory was 414.7MB in the beginning and 284.7MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-12-13 12:50:22,908 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.16ms. Allocated memory is still 104.9MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1915.38ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 102.5MB in the beginning and 105.8MB in the end (delta: -3.3MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.90ms. Allocated memory is still 172.0MB. Free memory was 105.8MB in the beginning and 94.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.06ms. Allocated memory is still 172.0MB. Free memory was 94.3MB in the beginning and 88.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1066.36ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 88.0MB in the beginning and 94.3MB in the end (delta: -6.3MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * TraceAbstraction took 50745.03ms. Allocated memory was 207.6MB in the beginning and 627.0MB in the end (delta: 419.4MB). Free memory was 93.3MB in the beginning and 414.7MB in the end (delta: -321.5MB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. * Witness Printer took 359.66ms. Allocated memory is still 627.0MB. Free memory was 414.7MB in the beginning and 284.7MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. 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_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] * 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, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.7s, OverallIterations: 25, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2363 SdHoareTripleChecker+Valid, 13.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2291 mSDsluCounter, 4153 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3199 mSDsCounter, 758 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12241 IncrementalHoareTripleChecker+Invalid, 13001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 758 mSolverCounterUnsat, 954 mSDtfsCounter, 12241 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1038 GetRequests, 624 SyntacticMatches, 19 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=22, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 260 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 222 PreInvPairs, 250 NumberOfFragments, 2914 HoareAnnotationTreeSize, 222 FomulaSimplifications, 928 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 21 FomulaSimplificationsInter, 10825 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1568 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1540 ConstructedInterpolants, 82 QuantifiedInterpolants, 9164 SizeOfPredicates, 40 NumberOfNonLiveVariables, 7547 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 626/675 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: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2022-12-13 12:50:22,911 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,911 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,912 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,914 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,914 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-12-13 12:50:22,915 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-12-13 12:50:22,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] Derived loop invariant: (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == aws_byte_buf_from_empty_array_#res#1.buffer) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && buf == 0) || (((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (aws_byte_buf_from_empty_array_#res#1.buffer == array && aws_byte_buf_from_empty_array_#res#1.buffer == 0))) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && !(bytes == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && bytes == 0) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) RESULT: Ultimate proved your program to be correct! [2022-12-13 12:50:22,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd23c733-7942-4965-8ca9-286c102ab44c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE