./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a --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 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- 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-b5237d8 [2022-11-21 16:09:01,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:09:01,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:09:01,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:09:01,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:09:01,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:09:01,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:09:01,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:09:01,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:09:01,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:09:01,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:09:01,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:09:01,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:09:01,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:09:01,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:09:01,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:09:01,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:09:01,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:09:01,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:09:01,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:09:01,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:09:01,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:09:01,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:09:01,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:09:01,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:09:01,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:09:01,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:09:01,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:09:01,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:09:01,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:09:01,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:09:01,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:09:01,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:09:01,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:09:01,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:09:01,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:09:01,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:09:01,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:09:01,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:09:01,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:09:01,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:09:01,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:09:01,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:09:01,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:09:01,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:09:01,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:09:01,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:09:01,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:09:01,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:09:01,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:09:01,468 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:09:01,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:09:01,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:09:01,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:09:01,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:09:01,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:09:01,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:09:01,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:09:01,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:09:01,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:09:01,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:09:01,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:09:01,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:09:01,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:09:01,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:09:01,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:09:01,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:09:01,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:09:01,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:09:01,475 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:09:01,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:09:01,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:09:01,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/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_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a 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 -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2022-11-21 16:09:01,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:09:01,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:09:01,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:09:01,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:09:01,827 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:09:01,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-21 16:09:04,828 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:09:05,432 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:09:05,433 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-21 16:09:05,480 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/data/767a95eba/ffbeb098171a498bbc71bec4257d7c26/FLAGe3dd53948 [2022-11-21 16:09:05,500 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/data/767a95eba/ffbeb098171a498bbc71bec4257d7c26 [2022-11-21 16:09:05,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:09:05,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:09:05,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:09:05,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:09:05,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:09:05,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:09:05" (1/1) ... [2022-11-21 16:09:05,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8e988c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:05, skipping insertion in model container [2022-11-21 16:09:05,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:09:05" (1/1) ... [2022-11-21 16:09:05,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:09:05,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:09:05,950 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_ff1cd5b2-b59f-4922-a560-700b09fa5d10/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-21 16:09:05,961 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_ff1cd5b2-b59f-4922-a560-700b09fa5d10/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-21 16:09:06,977 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:06,978 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:06,979 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:06,980 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:06,981 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:06,998 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:06,999 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:07,001 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:07,002 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:07,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 16:09:07,481 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 16:09:07,482 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 16:09:07,484 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 16:09:07,485 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 16:09:07,486 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 16:09:07,487 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 16:09:07,488 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 16:09:07,489 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 16:09:07,490 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 16:09:07,674 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 16:09:07,852 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:07,853 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:09:08,136 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:09:08,165 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_ff1cd5b2-b59f-4922-a560-700b09fa5d10/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-21 16:09:08,166 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_ff1cd5b2-b59f-4922-a560-700b09fa5d10/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-21 16:09:08,204 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,205 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,206 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,208 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,208 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,221 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,222 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,223 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,224 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,276 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 16:09:08,277 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 16:09:08,278 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 16:09:08,279 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 16:09:08,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 16:09:08,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 16:09:08,282 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 16:09:08,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 16:09:08,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 16:09:08,284 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 16:09:08,311 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 16:09:08,390 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,390 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:09:08,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:09:08,778 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:09:08,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08 WrapperNode [2022-11-21 16:09:08,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:09:08,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:09:08,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:09:08,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:09:08,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:08,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,004 INFO L138 Inliner]: procedures = 693, calls = 2791, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 873 [2022-11-21 16:09:09,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:09:09,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:09:09,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:09:09,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:09:09,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,109 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:09:09,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:09:09,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:09:09,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:09:09,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (1/1) ... [2022-11-21 16:09:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:09:09,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:09,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:09:09,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:09:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-21 16:09:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-21 16:09:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-21 16:09:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-21 16:09:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-11-21 16:09:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-11-21 16:09:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-21 16:09:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:09:09,223 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-21 16:09:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-21 16:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 16:09:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 16:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:09:09,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:09:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:09:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:09:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-21 16:09:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-21 16:09:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-21 16:09:09,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:09:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:09:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:09:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:09:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-11-21 16:09:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-11-21 16:09:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:09:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-21 16:09:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-21 16:09:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-21 16:09:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-21 16:09:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:09:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:09:09,573 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:09:09,580 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:09:11,338 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:09:11,345 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:09:11,345 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:09:11,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:11 BoogieIcfgContainer [2022-11-21 16:09:11,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:09:11,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:09:11,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:09:11,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:09:11,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:09:05" (1/3) ... [2022-11-21 16:09:11,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7270b30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:09:11, skipping insertion in model container [2022-11-21 16:09:11,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:08" (2/3) ... [2022-11-21 16:09:11,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7270b30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:09:11, skipping insertion in model container [2022-11-21 16:09:11,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:11" (3/3) ... [2022-11-21 16:09:11,357 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2022-11-21 16:09:11,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:09:11,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:09:11,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:09:11,453 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;@1ceac07e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:09:11,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:09:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-21 16:09:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:09:11,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:11,477 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 16:09:11,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash 39505431, now seen corresponding path program 1 times [2022-11-21 16:09:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:11,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463128299] [2022-11-21 16:09:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:09:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:09:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-21 16:09:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-21 16:09:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:12,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463128299] [2022-11-21 16:09:12,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463128299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:12,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:12,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962083779] [2022-11-21 16:09:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:12,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:12,446 INFO L87 Difference]: Start difference. First operand has 130 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:09:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:12,834 INFO L93 Difference]: Finished difference Result 251 states and 348 transitions. [2022-11-21 16:09:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-11-21 16:09:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:12,847 INFO L225 Difference]: With dead ends: 251 [2022-11-21 16:09:12,847 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 16:09:12,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:12,865 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:12,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 162 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:09:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 16:09:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-21 16:09:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 84 states have internal predecessors, (104), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-21 16:09:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2022-11-21 16:09:12,947 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 71 [2022-11-21 16:09:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:12,948 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2022-11-21 16:09:12,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:09:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2022-11-21 16:09:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:09:12,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:12,959 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 16:09:12,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:09:12,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 899154193, now seen corresponding path program 1 times [2022-11-21 16:09:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:12,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436745908] [2022-11-21 16:09:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-21 16:09:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:09:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-21 16:09:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-21 16:09:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436745908] [2022-11-21 16:09:13,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436745908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:13,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:13,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:09:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614192511] [2022-11-21 16:09:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:13,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:09:13,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:13,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:09:13,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:09:13,933 INFO L87 Difference]: Start difference. First operand 125 states and 165 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:09:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:14,518 INFO L93 Difference]: Finished difference Result 211 states and 280 transitions. [2022-11-21 16:09:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:09:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 71 [2022-11-21 16:09:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:14,522 INFO L225 Difference]: With dead ends: 211 [2022-11-21 16:09:14,522 INFO L226 Difference]: Without dead ends: 128 [2022-11-21 16:09:14,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:09:14,524 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 108 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:14,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 344 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:09:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-21 16:09:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-21 16:09:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 87 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-21 16:09:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2022-11-21 16:09:14,538 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 71 [2022-11-21 16:09:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:14,538 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2022-11-21 16:09:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:09:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2022-11-21 16:09:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 16:09:14,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:14,541 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 16:09:14,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:09:14,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1350542876, now seen corresponding path program 1 times [2022-11-21 16:09:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:14,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122041730] [2022-11-21 16:09:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:09:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:09:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-21 16:09:15,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:15,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122041730] [2022-11-21 16:09:15,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122041730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:15,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:15,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:09:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990060971] [2022-11-21 16:09:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:15,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:15,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:15,419 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:09:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:15,918 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-11-21 16:09:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 77 [2022-11-21 16:09:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:15,921 INFO L225 Difference]: With dead ends: 219 [2022-11-21 16:09:15,922 INFO L226 Difference]: Without dead ends: 163 [2022-11-21 16:09:15,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:15,929 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:15,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:09:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-21 16:09:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-11-21 16:09:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 108 states have internal predecessors, (132), 43 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-11-21 16:09:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 219 transitions. [2022-11-21 16:09:15,955 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 219 transitions. Word has length 77 [2022-11-21 16:09:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:15,956 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 219 transitions. [2022-11-21 16:09:15,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:09:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 219 transitions. [2022-11-21 16:09:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 16:09:15,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:15,965 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11-21 16:09:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:09:15,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash 32555997, now seen corresponding path program 1 times [2022-11-21 16:09:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:15,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173400156] [2022-11-21 16:09:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:09:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:09:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:09:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-21 16:09:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:17,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173400156] [2022-11-21 16:09:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173400156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:17,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:09:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829941623] [2022-11-21 16:09:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:17,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:09:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:09:17,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:09:17,301 INFO L87 Difference]: Start difference. First operand 161 states and 219 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:09:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:18,006 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2022-11-21 16:09:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:09:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2022-11-21 16:09:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:18,009 INFO L225 Difference]: With dead ends: 172 [2022-11-21 16:09:18,009 INFO L226 Difference]: Without dead ends: 165 [2022-11-21 16:09:18,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 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-11-21 16:09:18,011 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:18,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 648 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:09:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-21 16:09:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-21 16:09:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 109 states have (on average 1.238532110091743) internal successors, (135), 112 states have internal predecessors, (135), 43 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (48), 42 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-21 16:09:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 226 transitions. [2022-11-21 16:09:18,043 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 226 transitions. Word has length 89 [2022-11-21 16:09:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:18,044 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 226 transitions. [2022-11-21 16:09:18,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:09:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 226 transitions. [2022-11-21 16:09:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-21 16:09:18,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:18,046 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:18,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:09:18,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:18,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 581239205, now seen corresponding path program 1 times [2022-11-21 16:09:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:18,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708035933] [2022-11-21 16:09:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:09:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:09:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:09:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-21 16:09:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:19,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708035933] [2022-11-21 16:09:19,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708035933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:19,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:19,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:09:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144786459] [2022-11-21 16:09:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:19,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:09:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:09:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:09:19,265 INFO L87 Difference]: Start difference. First operand 165 states and 226 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:09:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:19,887 INFO L93 Difference]: Finished difference Result 300 states and 420 transitions. [2022-11-21 16:09:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:09:19,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2022-11-21 16:09:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:19,890 INFO L225 Difference]: With dead ends: 300 [2022-11-21 16:09:19,890 INFO L226 Difference]: Without dead ends: 190 [2022-11-21 16:09:19,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:09:19,891 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 137 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:19,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:09:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-21 16:09:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2022-11-21 16:09:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 117 states have internal predecessors, (142), 43 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (48), 42 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-21 16:09:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2022-11-21 16:09:19,915 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 93 [2022-11-21 16:09:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:19,916 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2022-11-21 16:09:19,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:09:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2022-11-21 16:09:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-21 16:09:19,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:19,918 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:19,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:09:19,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash 839404643, now seen corresponding path program 1 times [2022-11-21 16:09:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:19,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869531845] [2022-11-21 16:09:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:09:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:09:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:09:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:09:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869531845] [2022-11-21 16:09:22,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869531845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:22,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882114112] [2022-11-21 16:09:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:22,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:22,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:22,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:09:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:23,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 2597 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-21 16:09:23,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:23,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:09:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:09:23,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:23,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882114112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:23,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:09:23,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2022-11-21 16:09:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004314003] [2022-11-21 16:09:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:23,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:09:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:09:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:09:23,801 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:09:27,103 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-11-21 16:09:29,601 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-11-21 16:09:31,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:09:33,716 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-11-21 16:09:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:34,061 INFO L93 Difference]: Finished difference Result 300 states and 402 transitions. [2022-11-21 16:09:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:09:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-11-21 16:09:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:34,064 INFO L225 Difference]: With dead ends: 300 [2022-11-21 16:09:34,064 INFO L226 Difference]: Without dead ends: 185 [2022-11-21 16:09:34,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-11-21 16:09:34,066 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 240 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 57 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:34,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 824 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 405 Invalid, 4 Unknown, 0 Unchecked, 10.0s Time] [2022-11-21 16:09:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-21 16:09:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-11-21 16:09:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 124 states have internal predecessors, (150), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (45), 43 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-21 16:09:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2022-11-21 16:09:34,090 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 93 [2022-11-21 16:09:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:34,091 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2022-11-21 16:09:34,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:09:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2022-11-21 16:09:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-21 16:09:34,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:34,093 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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-11-21 16:09:34,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:34,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 16:09:34,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 302071913, now seen corresponding path program 1 times [2022-11-21 16:09:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:34,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053651888] [2022-11-21 16:09:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:09:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 16:09:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 16:09:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 16:09:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:09:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:09:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:35,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053651888] [2022-11-21 16:09:35,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053651888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:35,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556312422] [2022-11-21 16:09:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:35,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:35,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:35,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:09:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:36,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:09:36,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:09:36,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:36,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556312422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:36,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:09:36,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-11-21 16:09:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369206176] [2022-11-21 16:09:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:36,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:09:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:09:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:09:36,422 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:09:36,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:36,647 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2022-11-21 16:09:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:09:36,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2022-11-21 16:09:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:36,651 INFO L225 Difference]: With dead ends: 302 [2022-11-21 16:09:36,651 INFO L226 Difference]: Without dead ends: 190 [2022-11-21 16:09:36,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:09:36,653 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 13 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:36,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1172 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-21 16:09:36,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-11-21 16:09:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 129 states have internal predecessors, (154), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-21 16:09:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-11-21 16:09:36,688 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 97 [2022-11-21 16:09:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:36,690 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-11-21 16:09:36,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:09:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-11-21 16:09:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:09:36,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:36,693 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:36,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:36,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:36,905 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1510879250, now seen corresponding path program 1 times [2022-11-21 16:09:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280615868] [2022-11-21 16:09:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:09:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:09:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:09:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-21 16:09:37,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:37,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280615868] [2022-11-21 16:09:37,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280615868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:37,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103315801] [2022-11-21 16:09:37,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:37,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:37,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:09:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:37,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 2609 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:09:37,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 16:09:37,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:37,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103315801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:37,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:09:37,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-21 16:09:37,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354608039] [2022-11-21 16:09:37,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:37,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:37,948 INFO L87 Difference]: Start difference. First operand 187 states and 246 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:09:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:37,992 INFO L93 Difference]: Finished difference Result 309 states and 417 transitions. [2022-11-21 16:09:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-21 16:09:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:37,996 INFO L225 Difference]: With dead ends: 309 [2022-11-21 16:09:37,996 INFO L226 Difference]: Without dead ends: 192 [2022-11-21 16:09:37,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:09:37,998 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:37,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 483 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:09:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-21 16:09:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-11-21 16:09:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 128 states have (on average 1.21875) internal successors, (156), 131 states have internal predecessors, (156), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-21 16:09:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2022-11-21 16:09:38,029 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 99 [2022-11-21 16:09:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:38,030 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2022-11-21 16:09:38,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:09:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2022-11-21 16:09:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:09:38,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:38,035 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 16:09:38,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:38,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:38,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1932962354, now seen corresponding path program 1 times [2022-11-21 16:09:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:38,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76728375] [2022-11-21 16:09:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:09:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:09:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:09:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-21 16:09:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:38,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76728375] [2022-11-21 16:09:38,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76728375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:38,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304842719] [2022-11-21 16:09:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:38,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:38,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:38,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:09:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:39,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:09:39,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 16:09:39,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:09:39,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304842719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:39,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:09:39,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-21 16:09:39,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610615895] [2022-11-21 16:09:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:39,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:39,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:39,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:39,358 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:09:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:39,408 INFO L93 Difference]: Finished difference Result 325 states and 438 transitions. [2022-11-21 16:09:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-21 16:09:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:39,411 INFO L225 Difference]: With dead ends: 325 [2022-11-21 16:09:39,412 INFO L226 Difference]: Without dead ends: 206 [2022-11-21 16:09:39,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:09:39,415 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:39,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 498 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:09:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-21 16:09:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2022-11-21 16:09:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 128 states have (on average 1.2109375) internal successors, (155), 131 states have internal predecessors, (155), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-21 16:09:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2022-11-21 16:09:39,439 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 99 [2022-11-21 16:09:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:39,440 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2022-11-21 16:09:39,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:09:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2022-11-21 16:09:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:09:39,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:39,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:39,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:09:39,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 16:09:39,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:39,657 INFO L85 PathProgramCache]: Analyzing trace with hash -400430284, now seen corresponding path program 1 times [2022-11-21 16:09:39,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:39,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476298296] [2022-11-21 16:09:39,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:09:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:09:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:09:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:09:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:41,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:09:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:09:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:09:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:09:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:09:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:09:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:09:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:09:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:42,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476298296] [2022-11-21 16:09:42,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476298296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:09:42,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120981570] [2022-11-21 16:09:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:42,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:42,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:09:42,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:09:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:43,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 16:09:43,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:09:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:09:44,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:09:45,103 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-21 16:09:45,103 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 24 treesize of output 19 [2022-11-21 16:09:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:09:45,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120981570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:09:45,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:09:45,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 25 [2022-11-21 16:09:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543829951] [2022-11-21 16:09:45,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:09:45,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 16:09:45,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:45,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 16:09:45,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-11-21 16:09:45,135 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-21 16:09:47,979 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-11-21 16:09:50,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:09:52,167 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-11-21 16:09:55,242 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-11-21 16:09:57,386 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-11-21 16:09:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:59,146 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2022-11-21 16:09:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 16:09:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 99 [2022-11-21 16:09:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:59,148 INFO L225 Difference]: With dead ends: 277 [2022-11-21 16:09:59,149 INFO L226 Difference]: Without dead ends: 223 [2022-11-21 16:09:59,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-11-21 16:09:59,150 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 435 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 119 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:59,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 856 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2034 Invalid, 5 Unknown, 0 Unchecked, 13.2s Time] [2022-11-21 16:09:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-21 16:09:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2022-11-21 16:09:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.1917808219178083) internal successors, (174), 147 states have internal predecessors, (174), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (45), 43 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-21 16:09:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2022-11-21 16:09:59,178 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 99 [2022-11-21 16:09:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:59,178 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2022-11-21 16:09:59,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-21 16:09:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2022-11-21 16:09:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:09:59,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:59,180 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:59,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 16:09:59,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:09:59,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:09:59,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 768159994, now seen corresponding path program 1 times [2022-11-21 16:09:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:59,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226219914] [2022-11-21 16:09:59,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:10:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:10:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:10:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:10:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:10:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:10:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:10:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:10:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:10:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-21 16:10:02,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:02,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226219914] [2022-11-21 16:10:02,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226219914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:02,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062987818] [2022-11-21 16:10:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:02,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:02,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:10:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:03,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 2603 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 16:10:03,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:10:04,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:05,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:10:05,402 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 40 treesize of output 1 [2022-11-21 16:10:05,603 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-21 16:10:05,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2022-11-21 16:10:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:10:05,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062987818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:05,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:05,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 30 [2022-11-21 16:10:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014121145] [2022-11-21 16:10:05,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:05,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 16:10:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 16:10:05,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-11-21 16:10:05,772 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-21 16:10:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:13,977 INFO L93 Difference]: Finished difference Result 398 states and 508 transitions. [2022-11-21 16:10:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-21 16:10:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 99 [2022-11-21 16:10:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:13,984 INFO L225 Difference]: With dead ends: 398 [2022-11-21 16:10:13,984 INFO L226 Difference]: Without dead ends: 379 [2022-11-21 16:10:13,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=943, Invalid=3479, Unknown=0, NotChecked=0, Total=4422 [2022-11-21 16:10:13,987 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 471 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:13,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1035 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-21 16:10:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-21 16:10:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-11-21 16:10:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 248 states have (on average 1.2056451612903225) internal successors, (299), 250 states have internal predecessors, (299), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-21 16:10:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 444 transitions. [2022-11-21 16:10:14,031 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 444 transitions. Word has length 99 [2022-11-21 16:10:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:14,032 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 444 transitions. [2022-11-21 16:10:14,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-21 16:10:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 444 transitions. [2022-11-21 16:10:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:10:14,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:14,034 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:14,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:14,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:14,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2140021892, now seen corresponding path program 1 times [2022-11-21 16:10:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887616127] [2022-11-21 16:10:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:10:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:10:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:10:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:10:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:10:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:10:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:10:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:10:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:10:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-21 16:10:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:18,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887616127] [2022-11-21 16:10:18,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887616127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:18,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185012529] [2022-11-21 16:10:18,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:18,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:18,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:18,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:10:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 16:10:18,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:10:20,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:21,443 INFO L321 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-11-21 16:10:21,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 49 [2022-11-21 16:10:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:10:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185012529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:21,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:21,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 30 [2022-11-21 16:10:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765069245] [2022-11-21 16:10:21,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:21,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 16:10:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 16:10:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-11-21 16:10:21,807 INFO L87 Difference]: Start difference. First operand 344 states and 444 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-21 16:10:24,418 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-11-21 16:10:26,566 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-11-21 16:10:28,592 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-11-21 16:10:33,901 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-11-21 16:10:35,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:10:38,662 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-11-21 16:10:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:39,431 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2022-11-21 16:10:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 16:10:39,432 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 99 [2022-11-21 16:10:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:39,435 INFO L225 Difference]: With dead ends: 396 [2022-11-21 16:10:39,435 INFO L226 Difference]: Without dead ends: 380 [2022-11-21 16:10:39,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 193 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=475, Invalid=1877, Unknown=0, NotChecked=0, Total=2352 [2022-11-21 16:10:39,437 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 365 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 115 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:39,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 789 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2159 Invalid, 6 Unknown, 0 Unchecked, 15.8s Time] [2022-11-21 16:10:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-21 16:10:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 351. [2022-11-21 16:10:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 255 states have (on average 1.203921568627451) internal successors, (307), 257 states have internal predecessors, (307), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-21 16:10:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 452 transitions. [2022-11-21 16:10:39,505 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 452 transitions. Word has length 99 [2022-11-21 16:10:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:39,506 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 452 transitions. [2022-11-21 16:10:39,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-21 16:10:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 452 transitions. [2022-11-21 16:10:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 16:10:39,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:39,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:39,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:39,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 16:10:39,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1881856454, now seen corresponding path program 1 times [2022-11-21 16:10:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054084655] [2022-11-21 16:10:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:39,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:10:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:10:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:10:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:10:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:10:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:10:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:10:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:10:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:10:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-21 16:10:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054084655] [2022-11-21 16:10:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054084655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:40,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:40,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:10:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706764843] [2022-11-21 16:10:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:40,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:10:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:10:40,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:10:40,885 INFO L87 Difference]: Start difference. First operand 351 states and 452 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:10:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:41,594 INFO L93 Difference]: Finished difference Result 535 states and 680 transitions. [2022-11-21 16:10:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:10:41,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2022-11-21 16:10:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:41,599 INFO L225 Difference]: With dead ends: 535 [2022-11-21 16:10:41,599 INFO L226 Difference]: Without dead ends: 359 [2022-11-21 16:10:41,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:10:41,601 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:41,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 389 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:10:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-21 16:10:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 349. [2022-11-21 16:10:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 255 states have internal predecessors, (302), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-21 16:10:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2022-11-21 16:10:41,670 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 99 [2022-11-21 16:10:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:41,671 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2022-11-21 16:10:41,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:10:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2022-11-21 16:10:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 16:10:41,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:41,674 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11-21 16:10:41,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:10:41,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 964318207, now seen corresponding path program 1 times [2022-11-21 16:10:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:41,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428433526] [2022-11-21 16:10:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:10:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:10:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:10:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:10:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:10:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:10:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:10:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:10:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:10:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-21 16:10:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:43,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428433526] [2022-11-21 16:10:43,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428433526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:43,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:43,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 16:10:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066068372] [2022-11-21 16:10:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:43,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:10:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:43,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:10:43,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:10:43,007 INFO L87 Difference]: Start difference. First operand 349 states and 447 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:10:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:43,967 INFO L93 Difference]: Finished difference Result 363 states and 462 transitions. [2022-11-21 16:10:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:10:43,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2022-11-21 16:10:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:43,971 INFO L225 Difference]: With dead ends: 363 [2022-11-21 16:10:43,971 INFO L226 Difference]: Without dead ends: 323 [2022-11-21 16:10:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:10:43,972 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:43,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 814 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:10:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-21 16:10:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 304. [2022-11-21 16:10:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.2009132420091324) internal successors, (263), 221 states have internal predecessors, (263), 60 states have call successors, (60), 23 states have call predecessors, (60), 24 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-11-21 16:10:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 384 transitions. [2022-11-21 16:10:44,027 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 384 transitions. Word has length 101 [2022-11-21 16:10:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:44,028 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 384 transitions. [2022-11-21 16:10:44,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-21 16:10:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 384 transitions. [2022-11-21 16:10:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 16:10:44,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:44,030 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11-21 16:10:44,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:10:44,031 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1368667261, now seen corresponding path program 1 times [2022-11-21 16:10:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:44,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668119328] [2022-11-21 16:10:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-21 16:10:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 16:10:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-21 16:10:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:10:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:10:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:10:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:10:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-21 16:10:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 16:10:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:10:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:47,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668119328] [2022-11-21 16:10:47,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668119328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:47,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:47,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-21 16:10:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350503316] [2022-11-21 16:10:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:47,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 16:10:47,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 16:10:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:10:47,295 INFO L87 Difference]: Start difference. First operand 304 states and 384 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:10:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:49,003 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-11-21 16:10:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 16:10:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2022-11-21 16:10:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:49,007 INFO L225 Difference]: With dead ends: 324 [2022-11-21 16:10:49,007 INFO L226 Difference]: Without dead ends: 272 [2022-11-21 16:10:49,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-11-21 16:10:49,008 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 195 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:49,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 858 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 16:10:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-21 16:10:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2022-11-21 16:10:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.2032967032967032) internal successors, (219), 184 states have internal predecessors, (219), 46 states have call successors, (46), 22 states have call predecessors, (46), 23 states have return successors, (45), 45 states have call predecessors, (45), 44 states have call successors, (45) [2022-11-21 16:10:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2022-11-21 16:10:49,057 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 101 [2022-11-21 16:10:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:49,057 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2022-11-21 16:10:49,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:10:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2022-11-21 16:10:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-21 16:10:49,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:49,060 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-11-21 16:10:49,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:10:49,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:10:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -171267616, now seen corresponding path program 1 times [2022-11-21 16:10:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:49,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048766135] [2022-11-21 16:10:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:10:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:10:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:10:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:10:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 16:10:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:10:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:10:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 16:10:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:10:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 16:10:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 16:10:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 16:10:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:10:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:10:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-21 16:10:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048766135] [2022-11-21 16:10:50,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048766135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:10:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967895020] [2022-11-21 16:10:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:50,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:10:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:50,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:10:50,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:10:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:51,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 2715 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 16:10:51,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:10:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-21 16:10:51,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:10:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-21 16:10:51,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967895020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:10:51,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:10:51,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2022-11-21 16:10:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50658770] [2022-11-21 16:10:51,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:10:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 16:10:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:51,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 16:10:51,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-21 16:10:51,904 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-21 16:10:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:52,817 INFO L93 Difference]: Finished difference Result 262 states and 317 transitions. [2022-11-21 16:10:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:10:52,819 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) Word has length 117 [2022-11-21 16:10:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:52,820 INFO L225 Difference]: With dead ends: 262 [2022-11-21 16:10:52,820 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:10:52,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 16:10:52,822 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:52,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 250 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:10:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:10:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:10:52,825 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-11-21 16:10:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:10:52,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2022-11-21 16:10:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:52,826 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:10:52,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-21 16:10:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:10:52,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:10:52,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:10:52,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:10:53,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 16:10:53,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:11:07,986 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1))))) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-11-21 16:11:07,987 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-11-21 16:11:07,987 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-21 16:11:07,987 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-11-21 16:11:07,988 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse1 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (let ((.cse0 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (and (<= (+ .cse0 1) |ensure_string_is_allocated_bounded_length_~len~1#1|) (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ .cse0 15)))) .cse1) (or .cse1 (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-21 16:11:07,988 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-11-21 16:11:07,988 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-21 16:11:07,989 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-11-21 16:11:07,989 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-21 16:11:07,989 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-21 16:11:07,989 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-11-21 16:11:07,990 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-11-21 16:11:07,990 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-21 16:11:07,990 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-11-21 16:11:07,990 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-11-21 16:11:07,990 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-21 16:11:07,990 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-21 16:11:07,991 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-21 16:11:07,991 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-21 16:11:07,991 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (or (= |bounded_malloc_#in~size| bounded_malloc_~size) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))))) (= |old(#valid)| |#valid|)) [2022-11-21 16:11:07,991 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-11-21 16:11:07,991 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-11-21 16:11:07,991 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-11-21 16:11:07,991 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-11-21 16:11:07,992 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,992 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-11-21 16:11:07,992 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,993 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-21 16:11:07,994 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-11-21 16:11:07,995 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-11-21 16:11:07,995 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-11-21 16:11:07,997 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-21 16:11:07,998 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-21 16:11:07,998 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-21 16:11:07,998 INFO L895 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:07,999 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-21 16:11:07,999 INFO L899 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2022-11-21 16:11:07,999 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-11-21 16:11:07,999 INFO L895 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:07,999 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-11-21 16:11:08,000 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-21 16:11:08,000 INFO L899 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2022-11-21 16:11:08,000 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-11-21 16:11:08,000 INFO L895 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:08,001 INFO L895 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2022-11-21 16:11:08,001 INFO L895 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2022-11-21 16:11:08,001 INFO L899 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2022-11-21 16:11:08,001 INFO L899 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2022-11-21 16:11:08,001 INFO L895 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:08,002 INFO L899 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2022-11-21 16:11:08,002 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:11:08,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:11:08,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:11:08,002 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-21 16:11:08,003 INFO L902 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2022-11-21 16:11:08,003 INFO L899 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2022-11-21 16:11:08,003 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-11-21 16:11:08,003 INFO L895 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:08,004 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-11-21 16:11:08,004 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-21 16:11:08,004 INFO L899 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2022-11-21 16:11:08,004 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-11-21 16:11:08,004 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2022-11-21 16:11:08,005 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0))) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|))) (or (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1341#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1341#1|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|) .cse0 .cse1 .cse2) (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse5 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)))) (let ((.cse4 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse4 (+ .cse3 (* 18446744073709551616 (div (+ (- .cse3) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616))))) .cse0 .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) .cse2 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-21 16:11:08,005 INFO L895 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:08,005 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-11-21 16:11:08,006 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-11-21 16:11:08,006 INFO L899 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2022-11-21 16:11:08,006 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-21 16:11:08,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:11:08,006 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-21 16:11:08,006 INFO L895 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2022-11-21 16:11:08,007 INFO L899 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2022-11-21 16:11:08,007 INFO L899 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2022-11-21 16:11:08,007 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) [2022-11-21 16:11:08,007 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-11-21 16:11:08,007 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-21 16:11:08,008 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-11-21 16:11:08,008 INFO L895 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) [2022-11-21 16:11:08,008 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-11-21 16:11:08,008 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-21 16:11:08,008 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-11-21 16:11:08,009 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1349#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1349#1| 1)) [2022-11-21 16:11:08,009 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-11-21 16:11:08,009 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-11-21 16:11:08,009 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-21 16:11:08,010 INFO L899 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2022-11-21 16:11:08,010 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:08,010 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-11-21 16:11:08,010 INFO L899 garLoopResultBuilder]: For program point L9548-2(lines 9548 9554) no Hoare annotation was computed. [2022-11-21 16:11:08,011 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-21 16:11:08,011 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-21 16:11:08,011 INFO L895 garLoopResultBuilder]: At program point L9548-4(lines 9548 9554) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-21 16:11:08,012 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-11-21 16:11:08,012 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-21 16:11:08,012 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-21 16:11:08,012 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-21 16:11:08,012 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-21 16:11:08,012 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-21 16:11:08,013 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-21 16:11:08,017 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:08,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:11:08,039 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,043 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,049 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,064 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,064 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,064 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,065 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,067 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,069 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,080 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,081 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,081 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,081 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,082 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,083 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,083 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,083 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,084 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,084 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,084 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:11:08 BoogieIcfgContainer [2022-11-21 16:11:08,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:11:08,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:11:08,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:11:08,087 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:11:08,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:11" (3/4) ... [2022-11-21 16:11:08,090 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:11:08,107 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-11-21 16:11:08,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-21 16:11:08,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-11-21 16:11:08,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-21 16:11:08,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-21 16:11:08,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-21 16:11:08,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 16:11:08,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-21 16:11:08,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-21 16:11:08,110 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-11-21 16:11:08,129 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-11-21 16:11:08,144 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-11-21 16:11:08,146 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-21 16:11:08,147 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-21 16:11:08,149 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-21 16:11:08,151 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 16:11:08,152 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 16:11:08,153 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:11:08,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: !(\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: !(0 <= 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0]))) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) [2022-11-21 16:11:08,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((str == 0 && str == 0) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0])) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0))) && !(buf == 0)) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616))) && buf == 0 [2022-11-21 16:11:08,782 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:11:08,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:11:08,783 INFO L158 Benchmark]: Toolchain (without parser) took 123277.51ms. Allocated memory was 140.5MB in the beginning and 587.2MB in the end (delta: 446.7MB). Free memory was 91.5MB in the beginning and 227.2MB in the end (delta: -135.7MB). Peak memory consumption was 310.9MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,783 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 115.3MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:11:08,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3270.98ms. Allocated memory was 140.5MB in the beginning and 182.5MB in the end (delta: 41.9MB). Free memory was 90.9MB in the beginning and 123.5MB in the end (delta: -32.6MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 229.79ms. Allocated memory is still 182.5MB. Free memory was 123.5MB in the beginning and 111.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,784 INFO L158 Benchmark]: Boogie Preprocessor took 131.19ms. Allocated memory is still 182.5MB. Free memory was 111.9MB in the beginning and 104.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,784 INFO L158 Benchmark]: RCFGBuilder took 2205.64ms. Allocated memory is still 182.5MB. Free memory was 104.6MB in the beginning and 66.9MB in the end (delta: 37.7MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,785 INFO L158 Benchmark]: TraceAbstraction took 116735.29ms. Allocated memory was 182.5MB in the beginning and 587.2MB in the end (delta: 404.8MB). Free memory was 65.9MB in the beginning and 359.3MB in the end (delta: -293.4MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,785 INFO L158 Benchmark]: Witness Printer took 696.33ms. Allocated memory is still 587.2MB. Free memory was 359.3MB in the beginning and 227.2MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-11-21 16:11:08,787 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.22ms. Allocated memory is still 115.3MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3270.98ms. Allocated memory was 140.5MB in the beginning and 182.5MB in the end (delta: 41.9MB). Free memory was 90.9MB in the beginning and 123.5MB in the end (delta: -32.6MB). Peak memory consumption was 90.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 229.79ms. Allocated memory is still 182.5MB. Free memory was 123.5MB in the beginning and 111.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.19ms. Allocated memory is still 182.5MB. Free memory was 111.9MB in the beginning and 104.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2205.64ms. Allocated memory is still 182.5MB. Free memory was 104.6MB in the beginning and 66.9MB in the end (delta: 37.7MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * TraceAbstraction took 116735.29ms. Allocated memory was 182.5MB in the beginning and 587.2MB in the end (delta: 404.8MB). Free memory was 65.9MB in the beginning and 359.3MB in the end (delta: -293.4MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. * Witness Printer took 696.33ms. Allocated memory is still 587.2MB. Free memory was 359.3MB in the beginning and 227.2MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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 11 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 116.6s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 57.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 2593 SdHoareTripleChecker+Valid, 48.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2455 mSDsluCounter, 9755 SdHoareTripleChecker+Invalid, 46.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7954 mSDsCounter, 750 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11632 IncrementalHoareTripleChecker+Invalid, 12397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 750 mSolverCounterUnsat, 1801 mSDtfsCounter, 11632 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1839 GetRequests, 1503 SyntacticMatches, 31 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=12, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 177 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 359 PreInvPairs, 395 NumberOfFragments, 1931 HoareAnnotationTreeSize, 359 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 5783 FormulaSimplificationTreeSizeReductionInter, 14.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 2306 NumberOfCodeBlocks, 2306 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2692 ConstructedInterpolants, 101 QuantifiedInterpolants, 15263 SizeOfPredicates, 74 NumberOfNonLiveVariables, 20953 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 1690/1864 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: 6598]: Loop Invariant [2022-11-21 16:11:08,798 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,798 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,798 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,799 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,800 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,801 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,802 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] Derived loop invariant: (((((str == 0 && str == 0) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0])) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0))) && !(buf == 0)) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616))) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2022-11-21 16:11:08,803 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,804 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-unknown-#memory_int-unknown[buf][16] + 18446744073709551615) / 18446744073709551616) + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][buf + 8] == 0)) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 6806]: Loop Invariant [2022-11-21 16:11:08,805 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,807 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:11:08,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-21 16:11:08,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-21 16:11:08,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-21 16:11:08,808 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] Derived loop invariant: (((forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: !(\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: !(0 <= 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0]))) || ((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16)) RESULT: Ultimate proved your program to be correct! [2022-11-21 16:11:08,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff1cd5b2-b59f-4922-a560-700b09fa5d10/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE