./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:53:35,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:53:35,419 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 04:53:35,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:53:35,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:53:35,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:53:35,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:53:35,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:53:35,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:53:35,447 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:53:35,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:53:35,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:53:35,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:53:35,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:53:35,450 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:53:35,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:53:35,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:53:35,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:53:35,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:53:35,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:53:35,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:53:35,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:53:35,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:53:35,455 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:53:35,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:53:35,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:53:35,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:53:35,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:53:35,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:53:35,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:53:35,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:53:35,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:53:35,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:53:35,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:53:35,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:53:35,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:53:35,459 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:53:35,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:53:35,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:53:35,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/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_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d [2023-11-29 04:53:35,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:53:35,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:53:35,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:53:35,698 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:53:35,698 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:53:35,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2023-11-29 04:53:38,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:53:38,872 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:53:38,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2023-11-29 04:53:38,904 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/data/73b022b21/cb2580181ef4436fb842ee308f11fb74/FLAG02e853619 [2023-11-29 04:53:38,919 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/data/73b022b21/cb2580181ef4436fb842ee308f11fb74 [2023-11-29 04:53:38,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:53:38,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:53:38,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:53:38,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:53:38,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:53:38,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:53:38" (1/1) ... [2023-11-29 04:53:38,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309b1613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:38, skipping insertion in model container [2023-11-29 04:53:38,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:53:38" (1/1) ... [2023-11-29 04:53:39,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:53:39,316 WARN L240 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_536268f7-8524-4037-8091-2f868a3a6c6c/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i[4501,4514] [2023-11-29 04:53:39,322 WARN L240 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_536268f7-8524-4037-8091-2f868a3a6c6c/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i[4561,4574] [2023-11-29 04:53:40,152 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,152 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,153 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,154 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,156 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,170 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,171 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,173 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,174 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,596 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 04:53:40,598 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 04:53:40,599 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 04:53:40,601 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 04:53:40,602 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 04:53:40,603 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 04:53:40,604 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 04:53:40,605 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 04:53:40,605 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 04:53:40,606 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 04:53:40,921 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:40,921 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:53:41,071 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:53:41,087 WARN L240 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_536268f7-8524-4037-8091-2f868a3a6c6c/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i[4501,4514] [2023-11-29 04:53:41,087 WARN L240 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_536268f7-8524-4037-8091-2f868a3a6c6c/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i[4561,4574] [2023-11-29 04:53:41,129 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,129 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,130 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,130 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,131 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,138 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,139 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,140 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,140 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,177 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 04:53:41,178 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 04:53:41,179 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 04:53:41,180 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 04:53:41,181 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 04:53:41,182 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 04:53:41,182 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 04:53:41,183 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 04:53:41,183 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 04:53:41,184 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 04:53:41,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8253] [2023-11-29 04:53:41,340 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,340 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:53:41,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8739-8750] [2023-11-29 04:53:41,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:53:41,706 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,706 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,706 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,706 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,706 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,707 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,707 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,707 WARN L675 CHandler]: The function s_global_handler is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,707 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,707 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,708 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,708 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,708 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,708 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,708 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,709 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,709 WARN L675 CHandler]: The function tl_thread_handler is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,709 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,709 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,709 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:53:41,718 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:53:41,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41 WrapperNode [2023-11-29 04:53:41,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:53:41,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:53:41,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:53:41,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:53:41,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:41,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:41,903 INFO L138 Inliner]: procedures = 692, calls = 2790, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 832 [2023-11-29 04:53:41,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:53:41,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:53:41,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:53:41,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:53:41,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:41,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:41,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,014 INFO L175 MemorySlicer]: Split 529 memory accesses to 7 slices as follows [2, 5, 14, 256, 247, 2, 3]. 48 percent of accesses are in the largest equivalence class. The 504 initializations are split as follows [2, 5, 2, 256, 236, 0, 3]. The 7 writes are split as follows [0, 0, 2, 0, 3, 2, 0]. [2023-11-29 04:53:42,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:53:42,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:53:42,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:53:42,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:53:42,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (1/1) ... [2023-11-29 04:53:42,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:53:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:42,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:53:42,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:53:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-29 04:53:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-29 04:53:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-29 04:53:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-29 04:53:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2023-11-29 04:53:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2023-11-29 04:53:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:53:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-29 04:53:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-29 04:53:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:53:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:53:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:53:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:53:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:53:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 04:53:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 04:53:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 04:53:42,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 04:53:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:53:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:53:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 04:53:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:53:42,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:53:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-29 04:53:42,172 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-29 04:53:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 04:53:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 04:53:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 04:53:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 04:53:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 04:53:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 04:53:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 04:53:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2023-11-29 04:53:42,173 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2023-11-29 04:53:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:53:42,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:53:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 04:53:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-29 04:53:42,175 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-29 04:53:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 04:53:42,176 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 04:53:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:53:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:53:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:53:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:53:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:53:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 04:53:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 04:53:42,468 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:53:42,470 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:53:43,302 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:53:43,472 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:53:43,472 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:53:43,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:53:43 BoogieIcfgContainer [2023-11-29 04:53:43,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:53:43,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:53:43,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:53:43,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:53:43,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:53:38" (1/3) ... [2023-11-29 04:53:43,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6257f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:53:43, skipping insertion in model container [2023-11-29 04:53:43,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:41" (2/3) ... [2023-11-29 04:53:43,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6257f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:53:43, skipping insertion in model container [2023-11-29 04:53:43,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:53:43" (3/3) ... [2023-11-29 04:53:43,481 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_string_harness.i [2023-11-29 04:53:43,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:53:43,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:53:43,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:53:43,573 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=LoopHeads, 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;@76a0f343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:53:43,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:53:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 04:53:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:53:43,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:43,591 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:53:43,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:43,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 993524609, now seen corresponding path program 1 times [2023-11-29 04:53:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199272284] [2023-11-29 04:53:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:43,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:53:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:53:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:53:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:53:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:53:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:53:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:53:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:53:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:53:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:53:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199272284] [2023-11-29 04:53:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199272284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:44,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:44,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:53:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665703573] [2023-11-29 04:53:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:44,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:53:44,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:53:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:53:44,352 INFO L87 Difference]: Start difference. First operand has 89 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:53:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:44,732 INFO L93 Difference]: Finished difference Result 172 states and 235 transitions. [2023-11-29 04:53:44,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:53:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 75 [2023-11-29 04:53:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:44,743 INFO L225 Difference]: With dead ends: 172 [2023-11-29 04:53:44,743 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 04:53:44,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:53:44,751 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 82 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:44,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 78 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:53:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 04:53:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 04:53:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:53:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2023-11-29 04:53:44,800 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 75 [2023-11-29 04:53:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:44,802 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2023-11-29 04:53:44,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:53:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2023-11-29 04:53:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:53:44,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:44,806 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:53:44,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:53:44,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:44,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 136815295, now seen corresponding path program 1 times [2023-11-29 04:53:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799033734] [2023-11-29 04:53:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:53:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:53:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:53:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:53:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:53:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:53:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:53:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:53:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:53:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 04:53:46,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799033734] [2023-11-29 04:53:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799033734] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358752354] [2023-11-29 04:53:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:46,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:46,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:53:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:47,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:53:47,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 04:53:47,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:53:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358752354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:47,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:53:47,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 24 [2023-11-29 04:53:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697226586] [2023-11-29 04:53:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:47,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:53:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:47,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:53:47,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:53:47,382 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 12 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 04:53:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:47,732 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2023-11-29 04:53:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:53:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2023-11-29 04:53:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:47,737 INFO L225 Difference]: With dead ends: 152 [2023-11-29 04:53:47,737 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 04:53:47,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:53:47,741 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:47,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 851 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:53:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 04:53:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-11-29 04:53:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-29 04:53:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-11-29 04:53:47,762 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 75 [2023-11-29 04:53:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:47,763 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-11-29 04:53:47,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 4 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 04:53:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-11-29 04:53:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:53:47,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:47,766 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:53:47,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 04:53:47,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:47,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:47,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash -286831427, now seen corresponding path program 1 times [2023-11-29 04:53:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403737668] [2023-11-29 04:53:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:53:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:53:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:53:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:53:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:53:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:53:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:53:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:53:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:53:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 04:53:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403737668] [2023-11-29 04:53:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403737668] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613418768] [2023-11-29 04:53:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:49,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:49,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:49,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:49,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:53:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:50,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 2623 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 04:53:50,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 04:53:50,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:53:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613418768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:53:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 24 [2023-11-29 04:53:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722889493] [2023-11-29 04:53:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:50,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:53:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:53:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:53:50,551 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 14 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 04:53:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:50,888 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2023-11-29 04:53:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:53:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 75 [2023-11-29 04:53:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:50,891 INFO L225 Difference]: With dead ends: 160 [2023-11-29 04:53:50,891 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 04:53:50,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:53:50,894 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 16 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:50,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1110 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:53:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 04:53:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-11-29 04:53:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2023-11-29 04:53:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2023-11-29 04:53:50,909 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 75 [2023-11-29 04:53:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:50,910 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2023-11-29 04:53:50,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 04:53:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2023-11-29 04:53:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:53:50,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:50,912 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:53:50,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:53:51,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:51,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:51,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash -348871041, now seen corresponding path program 1 times [2023-11-29 04:53:51,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:51,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138853469] [2023-11-29 04:53:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:53:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:53:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:53:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:53:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:53:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:53:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:53:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:53:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:53:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:53:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138853469] [2023-11-29 04:53:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138853469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:53:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454276599] [2023-11-29 04:53:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:51,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:53:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:53:51,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:53:51,836 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:53:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:52,335 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2023-11-29 04:53:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:53:52,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 75 [2023-11-29 04:53:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:52,338 INFO L225 Difference]: With dead ends: 145 [2023-11-29 04:53:52,338 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 04:53:52,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:53:52,339 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 55 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:52,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:53:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 04:53:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 04:53:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-29 04:53:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-11-29 04:53:52,355 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 75 [2023-11-29 04:53:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:52,356 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-11-29 04:53:52,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 04:53:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-11-29 04:53:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 04:53:52,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:52,358 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:53:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:53:52,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:52,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1578262406, now seen corresponding path program 1 times [2023-11-29 04:53:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335675003] [2023-11-29 04:53:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:53:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:53:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:53:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:53:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:53:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:53:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:53:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:53:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:53:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:53:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335675003] [2023-11-29 04:53:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335675003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:53:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565719381] [2023-11-29 04:53:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:53,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:53:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:53,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:53:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:53:53,458 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:53:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:54,082 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2023-11-29 04:53:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:53:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 77 [2023-11-29 04:53:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:54,084 INFO L225 Difference]: With dead ends: 103 [2023-11-29 04:53:54,084 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 04:53:54,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:53:54,085 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 107 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:54,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 317 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:53:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 04:53:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2023-11-29 04:53:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2023-11-29 04:53:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2023-11-29 04:53:54,099 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 77 [2023-11-29 04:53:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:54,100 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2023-11-29 04:53:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:53:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2023-11-29 04:53:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 04:53:54,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:54,102 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:53:54,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:53:54,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:54,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash -959767886, now seen corresponding path program 1 times [2023-11-29 04:53:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772592757] [2023-11-29 04:53:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:53:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:53:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:53:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:53:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:53:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:53:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:53:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:53:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:53:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:53:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 04:53:58,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772592757] [2023-11-29 04:53:58,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772592757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502616488] [2023-11-29 04:53:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:58,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:58,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:58,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:53:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:58,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 2645 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 04:53:58,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-29 04:53:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:53:59,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:53:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502616488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:59,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:53:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 32 [2023-11-29 04:53:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474618485] [2023-11-29 04:53:59,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:59,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 04:53:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 04:53:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2023-11-29 04:53:59,303 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 18 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 04:54:03,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:08,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:12,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:16,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:17,069 INFO L93 Difference]: Finished difference Result 185 states and 224 transitions. [2023-11-29 04:54:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:54:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2023-11-29 04:54:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:17,072 INFO L225 Difference]: With dead ends: 185 [2023-11-29 04:54:17,072 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 04:54:17,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 04:54:17,074 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 82 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:17,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1319 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 573 Invalid, 4 Unknown, 0 Unchecked, 17.5s Time] [2023-11-29 04:54:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 04:54:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2023-11-29 04:54:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.144927536231884) internal successors, (79), 72 states have internal predecessors, (79), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-29 04:54:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2023-11-29 04:54:17,090 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 81 [2023-11-29 04:54:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:17,091 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2023-11-29 04:54:17,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 04:54:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2023-11-29 04:54:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 04:54:17,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:17,093 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:54:17,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:54:17,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:17,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:17,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -258703308, now seen corresponding path program 1 times [2023-11-29 04:54:17,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:17,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037440804] [2023-11-29 04:54:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:17,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:54:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:54:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:54:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:54:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:54:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:54:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:54:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:18,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:54:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:18,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:54:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:54:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037440804] [2023-11-29 04:54:18,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037440804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:54:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:54:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:54:18,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606181012] [2023-11-29 04:54:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:54:18,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:54:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:18,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:54:18,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:54:18,093 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:54:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:18,612 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2023-11-29 04:54:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:54:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 81 [2023-11-29 04:54:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:18,614 INFO L225 Difference]: With dead ends: 168 [2023-11-29 04:54:18,614 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 04:54:18,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:54:18,615 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:18,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 165 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:54:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 04:54:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-29 04:54:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 70 states have internal predecessors, (75), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-29 04:54:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2023-11-29 04:54:18,631 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 81 [2023-11-29 04:54:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:18,631 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2023-11-29 04:54:18,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:54:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2023-11-29 04:54:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 04:54:18,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:18,633 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:54:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:54:18,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:18,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1325888077, now seen corresponding path program 1 times [2023-11-29 04:54:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605211641] [2023-11-29 04:54:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:54:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:54:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:54:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:54:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:54:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:54:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:54:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:54:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:54:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:54:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605211641] [2023-11-29 04:54:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605211641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:54:19,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:54:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:54:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954753472] [2023-11-29 04:54:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:54:19,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:54:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:54:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:54:19,903 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:54:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:20,846 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2023-11-29 04:54:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:54:20,847 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2023-11-29 04:54:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:20,849 INFO L225 Difference]: With dead ends: 123 [2023-11-29 04:54:20,849 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 04:54:20,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:54:20,851 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 70 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:20,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 411 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:54:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 04:54:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2023-11-29 04:54:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 72 states have internal predecessors, (77), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-29 04:54:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2023-11-29 04:54:20,867 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 83 [2023-11-29 04:54:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:20,868 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2023-11-29 04:54:20,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:54:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2023-11-29 04:54:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 04:54:20,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:20,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 04:54:20,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:54:20,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:20,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 932861067, now seen corresponding path program 1 times [2023-11-29 04:54:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145687045] [2023-11-29 04:54:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:20,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:54:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:54:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:54:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:54:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:54:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:54:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:22,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:54:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:54:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:54:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:54:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:22,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145687045] [2023-11-29 04:54:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145687045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:54:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:54:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 04:54:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613933647] [2023-11-29 04:54:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:54:22,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:54:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:22,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:54:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:54:22,262 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 15 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:54:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:23,210 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2023-11-29 04:54:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:54:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2023-11-29 04:54:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:23,212 INFO L225 Difference]: With dead ends: 122 [2023-11-29 04:54:23,212 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 04:54:23,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:54:23,213 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 129 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:23,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 481 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:54:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 04:54:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2023-11-29 04:54:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.123076923076923) internal successors, (73), 67 states have internal predecessors, (73), 25 states have call successors, (25), 14 states have call predecessors, (25), 15 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2023-11-29 04:54:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2023-11-29 04:54:23,221 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 83 [2023-11-29 04:54:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:23,222 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2023-11-29 04:54:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 04:54:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2023-11-29 04:54:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:54:23,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:23,224 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 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] [2023-11-29 04:54:23,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:54:23,225 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:23,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash -681129941, now seen corresponding path program 1 times [2023-11-29 04:54:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794578193] [2023-11-29 04:54:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:23,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:54:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:54:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:54:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:54:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:54:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:54:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:54:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:54:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:54:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:54:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:54:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 04:54:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794578193] [2023-11-29 04:54:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794578193] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:54:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297968710] [2023-11-29 04:54:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:24,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:24,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:54:24,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:54:24,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:54:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:54:24,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 04:54:25,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:54:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297968710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:54:25,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:54:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 22 [2023-11-29 04:54:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082267805] [2023-11-29 04:54:25,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:54:25,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:54:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:54:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:54:25,074 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 04:54:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:25,290 INFO L93 Difference]: Finished difference Result 154 states and 180 transitions. [2023-11-29 04:54:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:54:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) Word has length 90 [2023-11-29 04:54:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:25,292 INFO L225 Difference]: With dead ends: 154 [2023-11-29 04:54:25,292 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 04:54:25,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2023-11-29 04:54:25,293 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:25,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 822 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:54:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 04:54:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-29 04:54:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 67 states have internal predecessors, (71), 25 states have call successors, (25), 14 states have call predecessors, (25), 15 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2023-11-29 04:54:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-11-29 04:54:25,300 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 90 [2023-11-29 04:54:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:25,300 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-11-29 04:54:25,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 04:54:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-11-29 04:54:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:54:25,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:25,301 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 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] [2023-11-29 04:54:25,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:54:25,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:25,502 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:25,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1838829993, now seen corresponding path program 1 times [2023-11-29 04:54:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974198867] [2023-11-29 04:54:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:54:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:54:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:54:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:54:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:54:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:54:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:54:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:54:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:54:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:54:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:54:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:54:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 04:54:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974198867] [2023-11-29 04:54:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974198867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:54:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117847753] [2023-11-29 04:54:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:31,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:31,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:54:31,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:54:31,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:54:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:32,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 04:54:32,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:32,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 04:54:34,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:54:35,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:54:35,746 INFO L378 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 98 treesize of output 106 [2023-11-29 04:54:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:54:38,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:54:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 04:54:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117847753] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:54:44,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:54:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35, 26] total 80 [2023-11-29 04:54:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899605679] [2023-11-29 04:54:44,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:54:44,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-29 04:54:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-29 04:54:44,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=5991, Unknown=0, NotChecked=0, Total=6320 [2023-11-29 04:54:44,863 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 80 states, 58 states have (on average 2.086206896551724) internal successors, (121), 63 states have internal predecessors, (121), 26 states have call successors, (39), 8 states have call predecessors, (39), 18 states have return successors, (39), 25 states have call predecessors, (39), 24 states have call successors, (39) [2023-11-29 04:55:01,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:55:17,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:55:21,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:55:22,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:55:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:24,827 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2023-11-29 04:55:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 04:55:24,828 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 58 states have (on average 2.086206896551724) internal successors, (121), 63 states have internal predecessors, (121), 26 states have call successors, (39), 8 states have call predecessors, (39), 18 states have return successors, (39), 25 states have call predecessors, (39), 24 states have call successors, (39) Word has length 90 [2023-11-29 04:55:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:24,830 INFO L225 Difference]: With dead ends: 193 [2023-11-29 04:55:24,830 INFO L226 Difference]: Without dead ends: 191 [2023-11-29 04:55:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4942 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=1373, Invalid=20089, Unknown=0, NotChecked=0, Total=21462 [2023-11-29 04:55:24,838 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 353 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 5148 mSolverCounterSat, 263 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 5448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 5148 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:24,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 935 Invalid, 5448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 5148 Invalid, 37 Unknown, 0 Unchecked, 21.4s Time] [2023-11-29 04:55:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-29 04:55:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 155. [2023-11-29 04:55:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 105 states have internal predecessors, (112), 29 states have call successors, (29), 21 states have call predecessors, (29), 23 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 04:55:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2023-11-29 04:55:24,864 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 90 [2023-11-29 04:55:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:24,864 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2023-11-29 04:55:24,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 58 states have (on average 2.086206896551724) internal successors, (121), 63 states have internal predecessors, (121), 26 states have call successors, (39), 8 states have call predecessors, (39), 18 states have return successors, (39), 25 states have call predecessors, (39), 24 states have call successors, (39) [2023-11-29 04:55:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2023-11-29 04:55:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 04:55:24,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:24,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:55:24,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:55:25,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 04:55:25,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:25,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2470667, now seen corresponding path program 1 times [2023-11-29 04:55:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:25,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144914073] [2023-11-29 04:55:25,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:25,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:55:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:55:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 04:55:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144914073] [2023-11-29 04:55:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144914073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:25,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:25,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:55:25,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468112111] [2023-11-29 04:55:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:25,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:55:25,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:55:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:55:25,533 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 04:55:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:25,908 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2023-11-29 04:55:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:55:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 101 [2023-11-29 04:55:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:25,910 INFO L225 Difference]: With dead ends: 184 [2023-11-29 04:55:25,910 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 04:55:25,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:55:25,911 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:25,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:55:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 04:55:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-11-29 04:55:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 105 states have internal predecessors, (110), 29 states have call successors, (29), 21 states have call predecessors, (29), 23 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 04:55:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2023-11-29 04:55:25,950 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 101 [2023-11-29 04:55:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:25,950 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2023-11-29 04:55:25,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 04:55:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2023-11-29 04:55:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 04:55:25,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:25,952 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:55:25,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:55:25,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:25,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1868513648, now seen corresponding path program 1 times [2023-11-29 04:55:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:25,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796883862] [2023-11-29 04:55:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:55:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:55:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 04:55:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796883862] [2023-11-29 04:55:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796883862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:26,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:55:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022525027] [2023-11-29 04:55:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:26,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:55:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:55:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:55:26,709 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 10 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 04:55:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:27,295 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2023-11-29 04:55:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:55:27,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2023-11-29 04:55:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:27,297 INFO L225 Difference]: With dead ends: 166 [2023-11-29 04:55:27,297 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 04:55:27,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:55:27,298 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:27,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 326 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:55:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 04:55:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2023-11-29 04:55:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.074766355140187) internal successors, (115), 111 states have internal predecessors, (115), 30 states have call successors, (30), 22 states have call predecessors, (30), 25 states have return successors, (33), 29 states have call predecessors, (33), 29 states have call successors, (33) [2023-11-29 04:55:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2023-11-29 04:55:27,331 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 103 [2023-11-29 04:55:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:27,331 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2023-11-29 04:55:27,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 04:55:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2023-11-29 04:55:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 04:55:27,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:27,333 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:27,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:55:27,333 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1866387624, now seen corresponding path program 1 times [2023-11-29 04:55:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396751481] [2023-11-29 04:55:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:55:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:55:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 04:55:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396751481] [2023-11-29 04:55:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396751481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832437077] [2023-11-29 04:55:28,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:28,949 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:28,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:55:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:29,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 2732 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 04:55:29,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:29,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:55:29,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:55:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-29 04:55:30,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832437077] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:30,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:55:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2023-11-29 04:55:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810296171] [2023-11-29 04:55:30,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:30,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 04:55:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:30,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 04:55:30,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:55:30,552 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 17 states have internal predecessors, (73), 8 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2023-11-29 04:55:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:33,355 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2023-11-29 04:55:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:55:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 17 states have internal predecessors, (73), 8 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) Word has length 107 [2023-11-29 04:55:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:33,358 INFO L225 Difference]: With dead ends: 212 [2023-11-29 04:55:33,358 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 04:55:33,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 151 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:55:33,359 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 117 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:33,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 384 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 04:55:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 04:55:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2023-11-29 04:55:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 115 states have internal predecessors, (118), 36 states have call successors, (36), 25 states have call predecessors, (36), 27 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:55:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2023-11-29 04:55:33,393 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 107 [2023-11-29 04:55:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:33,394 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2023-11-29 04:55:33,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 17 states have internal predecessors, (73), 8 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (26), 7 states have call predecessors, (26), 7 states have call successors, (26) [2023-11-29 04:55:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2023-11-29 04:55:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 04:55:33,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:33,395 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:55:33,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:55:33,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:33,596 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:33,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1152027573, now seen corresponding path program 1 times [2023-11-29 04:55:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080608326] [2023-11-29 04:55:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:55:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:55:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:55:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 04:55:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080608326] [2023-11-29 04:55:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080608326] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636422100] [2023-11-29 04:55:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:36,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:36,787 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:36,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:55:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:37,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-29 04:55:37,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:37,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 04:55:37,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:55:39,316 INFO L349 Elim1Store]: treesize reduction 12, result has 80.3 percent of original size [2023-11-29 04:55:39,316 INFO L378 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 70 treesize of output 86 [2023-11-29 04:55:39,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:55:39,337 INFO L378 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 96 treesize of output 84 [2023-11-29 04:55:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 04:55:39,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636422100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:39,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:55:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 37 [2023-11-29 04:55:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875382172] [2023-11-29 04:55:39,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:39,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 04:55:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 04:55:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1581, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 04:55:39,879 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand has 37 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 14 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (28), 13 states have call predecessors, (28), 12 states have call successors, (28) [2023-11-29 04:55:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:44,213 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2023-11-29 04:55:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 04:55:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 14 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (28), 13 states have call predecessors, (28), 12 states have call successors, (28) Word has length 109 [2023-11-29 04:55:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:44,216 INFO L225 Difference]: With dead ends: 211 [2023-11-29 04:55:44,216 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 04:55:44,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 155 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=372, Invalid=3288, Unknown=0, NotChecked=0, Total=3660 [2023-11-29 04:55:44,219 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 217 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 123 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:44,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 511 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1902 Invalid, 25 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 04:55:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 04:55:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2023-11-29 04:55:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 131 states have (on average 1.0534351145038168) internal successors, (138), 134 states have internal predecessors, (138), 43 states have call successors, (43), 30 states have call predecessors, (43), 32 states have return successors, (43), 42 states have call predecessors, (43), 40 states have call successors, (43) [2023-11-29 04:55:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2023-11-29 04:55:44,271 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 109 [2023-11-29 04:55:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:44,272 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2023-11-29 04:55:44,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 14 states have call successors, (32), 6 states have call predecessors, (32), 7 states have return successors, (28), 13 states have call predecessors, (28), 12 states have call successors, (28) [2023-11-29 04:55:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2023-11-29 04:55:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 04:55:44,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:44,273 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-29 04:55:44,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:55:44,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:44,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:44,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -220618780, now seen corresponding path program 1 times [2023-11-29 04:55:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829913973] [2023-11-29 04:55:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:55:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:55:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:55:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:55:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 04:55:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:46,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829913973] [2023-11-29 04:55:46,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829913973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:46,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:46,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 04:55:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139823300] [2023-11-29 04:55:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:46,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:55:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:55:46,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:55:46,505 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 8 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-29 04:55:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:47,563 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2023-11-29 04:55:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:55:47,564 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 8 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) Word has length 115 [2023-11-29 04:55:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:47,566 INFO L225 Difference]: With dead ends: 221 [2023-11-29 04:55:47,566 INFO L226 Difference]: Without dead ends: 219 [2023-11-29 04:55:47,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:55:47,567 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 54 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:47,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 547 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:55:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-29 04:55:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-11-29 04:55:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.05) internal successors, (147), 143 states have internal predecessors, (147), 43 states have call successors, (43), 33 states have call predecessors, (43), 35 states have return successors, (43), 42 states have call predecessors, (43), 40 states have call successors, (43) [2023-11-29 04:55:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 233 transitions. [2023-11-29 04:55:47,612 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 233 transitions. Word has length 115 [2023-11-29 04:55:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:47,612 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 233 transitions. [2023-11-29 04:55:47,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 8 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-29 04:55:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 233 transitions. [2023-11-29 04:55:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:55:47,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:47,613 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:47,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:55:47,614 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:47,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash 837939003, now seen corresponding path program 1 times [2023-11-29 04:55:47,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:47,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656537207] [2023-11-29 04:55:47,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:55:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:55:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 04:55:48,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656537207] [2023-11-29 04:55:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656537207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012191698] [2023-11-29 04:55:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:48,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:48,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:55:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:48,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 2749 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:55:48,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-29 04:55:48,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012191698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:55:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-11-29 04:55:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832119479] [2023-11-29 04:55:48,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:48,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:55:48,938 INFO L87 Difference]: Start difference. First operand 219 states and 233 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 04:55:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:49,408 INFO L93 Difference]: Finished difference Result 318 states and 341 transitions. [2023-11-29 04:55:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:55:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2023-11-29 04:55:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:49,411 INFO L225 Difference]: With dead ends: 318 [2023-11-29 04:55:49,411 INFO L226 Difference]: Without dead ends: 219 [2023-11-29 04:55:49,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:55:49,412 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:49,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 332 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:55:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-29 04:55:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-11-29 04:55:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.042857142857143) internal successors, (146), 143 states have internal predecessors, (146), 43 states have call successors, (43), 33 states have call predecessors, (43), 35 states have return successors, (43), 42 states have call predecessors, (43), 40 states have call successors, (43) [2023-11-29 04:55:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 232 transitions. [2023-11-29 04:55:49,457 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 232 transitions. Word has length 113 [2023-11-29 04:55:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:49,457 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 232 transitions. [2023-11-29 04:55:49,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 04:55:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 232 transitions. [2023-11-29 04:55:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 04:55:49,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:49,458 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:49,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 04:55:49,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:49,659 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:49,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -533868295, now seen corresponding path program 1 times [2023-11-29 04:55:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348937435] [2023-11-29 04:55:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:55:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:55:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:55:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:55:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:55:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:55:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:55:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:55:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:55:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:55:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:55:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:55:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:55:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:55:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 04:55:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348937435] [2023-11-29 04:55:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348937435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546562878] [2023-11-29 04:55:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:51,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:51,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:51,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:51,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 04:55:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:52,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 04:55:52,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:52,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-29 04:55:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 04:55:53,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:55:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546562878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:55:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 34 [2023-11-29 04:55:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216803789] [2023-11-29 04:55:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:53,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:55:53,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:55:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:55:53,706 INFO L87 Difference]: Start difference. First operand 219 states and 232 transitions. Second operand has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 8 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (17), 11 states have call predecessors, (17), 7 states have call successors, (17) [2023-11-29 04:55:57,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:02,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:06,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:10,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:14,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:18,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:22,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:26,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:56:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:56:27,576 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2023-11-29 04:56:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:56:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 8 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (17), 11 states have call predecessors, (17), 7 states have call successors, (17) Word has length 113 [2023-11-29 04:56:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:56:27,578 INFO L225 Difference]: With dead ends: 248 [2023-11-29 04:56:27,578 INFO L226 Difference]: Without dead ends: 215 [2023-11-29 04:56:27,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=146, Invalid=1494, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 04:56:27,580 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 20 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:56:27,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1073 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 683 Invalid, 8 Unknown, 0 Unchecked, 33.6s Time] [2023-11-29 04:56:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-29 04:56:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-11-29 04:56:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 139 states have internal predecessors, (142), 43 states have call successors, (43), 33 states have call predecessors, (43), 34 states have return successors, (42), 42 states have call predecessors, (42), 40 states have call successors, (42) [2023-11-29 04:56:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 227 transitions. [2023-11-29 04:56:27,625 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 227 transitions. Word has length 113 [2023-11-29 04:56:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:56:27,625 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 227 transitions. [2023-11-29 04:56:27,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 8 states have call successors, (18), 4 states have call predecessors, (18), 7 states have return successors, (17), 11 states have call predecessors, (17), 7 states have call successors, (17) [2023-11-29 04:56:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 227 transitions. [2023-11-29 04:56:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 04:56:27,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:27,626 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 04:56:27,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 04:56:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 04:56:27,827 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:56:27,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1400527780, now seen corresponding path program 1 times [2023-11-29 04:56:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137806945] [2023-11-29 04:56:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:56:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:56:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:56:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:56:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:56:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:56:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:56:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:56:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:56:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:56:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:56:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:56:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:56:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:56:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:56:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:56:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:56:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:56:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 04:56:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137806945] [2023-11-29 04:56:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137806945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:56:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864154433] [2023-11-29 04:56:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:29,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:56:29,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:56:29,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:56:29,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 04:56:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:29,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 2755 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 04:56:29,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:29,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 04:56:29,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:56:33,767 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_BEFORE_CALL_10|) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_40|) 8))) is different from true [2023-11-29 04:56:37,871 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_41| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_BEFORE_CALL_11|) (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_41|) 8))) is different from true [2023-11-29 04:56:42,015 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_42| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_30|) .cse0) (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_42|) 8) .cse0)))) is different from true [2023-11-29 04:56:46,142 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_43| Int)) (let ((.cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_19|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_31|)) (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_43|) 8) .cse0)))) is different from true [2023-11-29 04:56:50,275 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_32|)) (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_44|) 8) .cse0)))) is different from true [2023-11-29 04:56:54,599 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_33| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_45|) 8) .cse0) (= (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_21|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_33|) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_24| Int)) (let ((.cse1 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_24|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_24|))) (and (= .cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_44|) 8)) (= .cse1 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_32|)))))) is different from true [2023-11-29 04:56:58,729 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_33| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse0 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_45|) 8) .cse0) (= (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_21|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_33|) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_24| Int)) (let ((.cse1 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_24|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_24|))) (and (= .cse1 (select (select |c_#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_44|) 8)) (= .cse1 (select (select |c_#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset_BEFORE_CALL_32|))))) (not (= (mod |c___VERIFIER_assert_#in~cond| 256) 0))) is different from true [2023-11-29 04:56:58,864 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:56:58,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 04:56:58,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:56:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 23 not checked. [2023-11-29 04:56:58,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864154433] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:56:59,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:56:59,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26] total 36 [2023-11-29 04:56:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072741021] [2023-11-29 04:56:59,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:56:59,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 04:56:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 04:56:59,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1246, Unknown=7, NotChecked=532, Total=1892 [2023-11-29 04:56:59,553 INFO L87 Difference]: Start difference. First operand 215 states and 227 transitions. Second operand has 36 states, 31 states have (on average 3.032258064516129) internal successors, (94), 28 states have internal predecessors, (94), 11 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (31), 12 states have call predecessors, (31), 10 states have call successors, (31) [2023-11-29 04:57:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:05,949 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2023-11-29 04:57:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 04:57:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 3.032258064516129) internal successors, (94), 28 states have internal predecessors, (94), 11 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (31), 12 states have call predecessors, (31), 10 states have call successors, (31) Word has length 115 [2023-11-29 04:57:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:05,951 INFO L225 Difference]: With dead ends: 227 [2023-11-29 04:57:05,951 INFO L226 Difference]: Without dead ends: 191 [2023-11-29 04:57:05,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 146 SyntacticMatches, 14 SemanticMatches, 63 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=303, Invalid=3024, Unknown=7, NotChecked=826, Total=4160 [2023-11-29 04:57:05,953 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 143 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1020 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:05,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 820 Invalid, 3781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2683 Invalid, 0 Unknown, 1020 Unchecked, 4.3s Time] [2023-11-29 04:57:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-29 04:57:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2023-11-29 04:57:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.032258064516129) internal successors, (128), 125 states have internal predecessors, (128), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (35), 35 states have call predecessors, (35), 34 states have call successors, (35) [2023-11-29 04:57:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 199 transitions. [2023-11-29 04:57:06,001 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 199 transitions. Word has length 115 [2023-11-29 04:57:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:06,001 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 199 transitions. [2023-11-29 04:57:06,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 3.032258064516129) internal successors, (94), 28 states have internal predecessors, (94), 11 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (31), 12 states have call predecessors, (31), 10 states have call successors, (31) [2023-11-29 04:57:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 199 transitions. [2023-11-29 04:57:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 04:57:06,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:06,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2023-11-29 04:57:06,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 04:57:06,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:57:06,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:06,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -825993966, now seen corresponding path program 1 times [2023-11-29 04:57:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697875308] [2023-11-29 04:57:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:57:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:57:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:57:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:57:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:57:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:57:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:57:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:57:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:57:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:57:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:57:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:57:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 04:57:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:07,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697875308] [2023-11-29 04:57:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697875308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:07,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:07,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 04:57:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516364149] [2023-11-29 04:57:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:07,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:57:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:57:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:57:07,394 INFO L87 Difference]: Start difference. First operand 191 states and 199 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 04:57:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:08,353 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2023-11-29 04:57:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:57:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2023-11-29 04:57:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:08,355 INFO L225 Difference]: With dead ends: 197 [2023-11-29 04:57:08,355 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 04:57:08,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:57:08,356 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 96 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:08,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 519 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:57:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 04:57:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2023-11-29 04:57:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 106 states have internal predecessors, (108), 29 states have call successors, (29), 25 states have call predecessors, (29), 25 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 04:57:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 166 transitions. [2023-11-29 04:57:08,392 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 166 transitions. Word has length 115 [2023-11-29 04:57:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:08,392 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 166 transitions. [2023-11-29 04:57:08,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-29 04:57:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2023-11-29 04:57:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 04:57:08,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:08,393 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 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] [2023-11-29 04:57:08,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:57:08,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:08,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash -999178821, now seen corresponding path program 1 times [2023-11-29 04:57:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140351276] [2023-11-29 04:57:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:57:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:57:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:57:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:57:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:57:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:57:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:57:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:57:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:57:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:57:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:57:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:57:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:57:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:57:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:57:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-29 04:57:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140351276] [2023-11-29 04:57:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140351276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:57:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417552922] [2023-11-29 04:57:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:10,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:57:10,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:57:10,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:57:10,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 04:57:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 04:57:10,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:57:11,043 INFO L378 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 20 treesize of output 9 [2023-11-29 04:57:13,280 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:57:13,280 INFO L378 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 44 treesize of output 14 [2023-11-29 04:57:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-11-29 04:57:13,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:57:13,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-29 04:57:13,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:57:13,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2023-11-29 04:57:13,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-11-29 04:57:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 04:57:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417552922] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:57:13,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:57:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 19] total 48 [2023-11-29 04:57:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324295885] [2023-11-29 04:57:13,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:57:13,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 04:57:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 04:57:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2127, Unknown=0, NotChecked=0, Total=2256 [2023-11-29 04:57:13,988 INFO L87 Difference]: Start difference. First operand 160 states and 166 transitions. Second operand has 48 states, 35 states have (on average 2.6) internal successors, (91), 37 states have internal predecessors, (91), 19 states have call successors, (42), 6 states have call predecessors, (42), 12 states have return successors, (41), 21 states have call predecessors, (41), 16 states have call successors, (41) [2023-11-29 04:57:18,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:57:23,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:57:27,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:57:31,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:57:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:34,644 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2023-11-29 04:57:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:57:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 35 states have (on average 2.6) internal successors, (91), 37 states have internal predecessors, (91), 19 states have call successors, (42), 6 states have call predecessors, (42), 12 states have return successors, (41), 21 states have call predecessors, (41), 16 states have call successors, (41) Word has length 121 [2023-11-29 04:57:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:34,646 INFO L225 Difference]: With dead ends: 166 [2023-11-29 04:57:34,646 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 04:57:34,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 240 SyntacticMatches, 16 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=327, Invalid=4785, Unknown=0, NotChecked=0, Total=5112 [2023-11-29 04:57:34,649 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 108 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 80 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:34,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 988 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2725 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2023-11-29 04:57:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 04:57:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-29 04:57:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 29 states have call successors, (29), 26 states have call predecessors, (29), 25 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 04:57:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2023-11-29 04:57:34,687 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 167 transitions. Word has length 121 [2023-11-29 04:57:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:34,687 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 167 transitions. [2023-11-29 04:57:34,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 35 states have (on average 2.6) internal successors, (91), 37 states have internal predecessors, (91), 19 states have call successors, (42), 6 states have call predecessors, (42), 12 states have return successors, (41), 21 states have call predecessors, (41), 16 states have call successors, (41) [2023-11-29 04:57:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 167 transitions. [2023-11-29 04:57:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 04:57:34,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:34,688 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:34,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 04:57:34,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 04:57:34,889 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:34,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash -530769958, now seen corresponding path program 1 times [2023-11-29 04:57:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:34,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711342444] [2023-11-29 04:57:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:57:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:57:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:57:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:57:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:57:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:57:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:57:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:57:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:57:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:57:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 04:57:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:57:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 04:57:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 04:57:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:57:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:57:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 04:57:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 04:57:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 04:57:36,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:36,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711342444] [2023-11-29 04:57:36,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711342444] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:57:36,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524692342] [2023-11-29 04:57:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:36,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:57:36,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:57:36,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:57:36,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 04:57:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:37,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 04:57:37,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:57:37,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 04:57:37,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:57:37,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:57:37,889 INFO L378 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 32 treesize of output 28 [2023-11-29 04:57:39,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 04:57:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 04:57:39,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:57:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-29 04:57:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524692342] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:57:39,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:57:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 10] total 34 [2023-11-29 04:57:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342223267] [2023-11-29 04:57:39,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:57:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 04:57:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 04:57:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:57:39,907 INFO L87 Difference]: Start difference. First operand 162 states and 167 transitions. Second operand has 34 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 28 states have internal predecessors, (101), 15 states have call successors, (52), 6 states have call predecessors, (52), 9 states have return successors, (51), 14 states have call predecessors, (51), 15 states have call successors, (51) [2023-11-29 04:57:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:43,728 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2023-11-29 04:57:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 04:57:43,729 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 28 states have internal predecessors, (101), 15 states have call successors, (52), 6 states have call predecessors, (52), 9 states have return successors, (51), 14 states have call predecessors, (51), 15 states have call successors, (51) Word has length 137 [2023-11-29 04:57:43,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:43,730 INFO L225 Difference]: With dead ends: 201 [2023-11-29 04:57:43,730 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 04:57:43,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 287 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=335, Invalid=2527, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 04:57:43,732 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 157 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 67 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:43,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 570 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2072 Invalid, 19 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 04:57:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 04:57:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2023-11-29 04:57:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 84 states have internal predecessors, (85), 25 states have call successors, (25), 21 states have call predecessors, (25), 20 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:57:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2023-11-29 04:57:43,759 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 137 [2023-11-29 04:57:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:43,759 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2023-11-29 04:57:43,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 28 states have internal predecessors, (101), 15 states have call successors, (52), 6 states have call predecessors, (52), 9 states have return successors, (51), 14 states have call predecessors, (51), 15 states have call successors, (51) [2023-11-29 04:57:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2023-11-29 04:57:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 04:57:43,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:43,761 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:43,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 04:57:43,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 04:57:43,962 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:43,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1374077692, now seen corresponding path program 1 times [2023-11-29 04:57:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:43,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502275884] [2023-11-29 04:57:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 04:58:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 04:58:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:58:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:58:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 04:58:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:58:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 04:58:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:58:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:58:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 04:58:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 04:58:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:58:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 04:58:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:58:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 04:58:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 04:58:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 04:58:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 04:58:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-29 04:58:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502275884] [2023-11-29 04:58:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502275884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:58:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928944858] [2023-11-29 04:58:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:58:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:58:21,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:58:21,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 04:58:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:21,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 04:58:21,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:22,041 INFO L378 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 8 treesize of output 1 [2023-11-29 04:58:22,451 INFO L378 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 20 treesize of output 9 [2023-11-29 04:58:22,457 INFO L378 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 20 treesize of output 9 [2023-11-29 04:58:24,804 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 04:58:24,804 INFO L378 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 34 treesize of output 10 [2023-11-29 04:58:24,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:24,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 39 [2023-11-29 04:58:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 26 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-11-29 04:58:24,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928944858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:58:25,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:58:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21] total 45 [2023-11-29 04:58:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106452007] [2023-11-29 04:58:25,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:58:25,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 04:58:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 04:58:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=2237, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 04:58:25,562 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 45 states, 36 states have (on average 2.75) internal successors, (99), 34 states have internal predecessors, (99), 20 states have call successors, (44), 5 states have call predecessors, (44), 10 states have return successors, (43), 24 states have call predecessors, (43), 19 states have call successors, (43) [2023-11-29 04:58:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:30,547 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2023-11-29 04:58:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 04:58:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 2.75) internal successors, (99), 34 states have internal predecessors, (99), 20 states have call successors, (44), 5 states have call predecessors, (44), 10 states have return successors, (43), 24 states have call predecessors, (43), 19 states have call successors, (43) Word has length 149 [2023-11-29 04:58:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:30,548 INFO L225 Difference]: With dead ends: 132 [2023-11-29 04:58:30,548 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:58:30,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 165 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=348, Invalid=5504, Unknown=0, NotChecked=0, Total=5852 [2023-11-29 04:58:30,550 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 129 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:30,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 848 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 04:58:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:58:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:58:30,550 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) [2023-11-29 04:58:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:58:30,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2023-11-29 04:58:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:30,550 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:58:30,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 2.75) internal successors, (99), 34 states have internal predecessors, (99), 20 states have call successors, (44), 5 states have call predecessors, (44), 10 states have return successors, (43), 24 states have call predecessors, (43), 19 states have call successors, (43) [2023-11-29 04:58:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:58:30,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:58:30,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:58:30,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 04:58:30,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 04:58:30,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:58:59,547 WARN L293 SmtUtils]: Spent 20.70s on a formula simplification. DAG size of input: 310 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 04:58:59,564 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-29 04:58:59,564 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-29 04:58:59,564 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-29 04:58:59,564 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-29 04:58:59,564 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2023-11-29 04:58:59,564 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2023-11-29 04:58:59,564 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6252 6257) the Hoare annotation is: true [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,565 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7368 7372) the Hoare annotation is: true [2023-11-29 04:58:59,565 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (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|)) (or (< 0 (+ (div |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616) 1)) .cse0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or .cse0 (< |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 16))))) [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2023-11-29 04:58:59,566 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (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_real#4| |old(#memory_real#4)|) (or (< 0 (+ (div |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616) 1)) .cse0) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (or .cse0 (< |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 16))) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|))) [2023-11-29 04:58:59,566 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2023-11-29 04:58:59,567 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (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|)) (or (< 0 (+ (div |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616) 1)) .cse0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or .cse0 (< |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 16))))) [2023-11-29 04:58:59,567 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2023-11-29 04:58:59,567 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (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_real#4| |old(#memory_real#4)|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) [2023-11-29 04:58:59,567 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2023-11-29 04:58:59,567 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2023-11-29 04:58:59,567 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (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_real#4| |old(#memory_real#4)|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) [2023-11-29 04:58:59,567 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2023-11-29 04:58:59,567 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_real#4| |old(#memory_real#4)|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_real#1| |old(#memory_real#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) [2023-11-29 04:58:59,567 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2023-11-29 04:58:59,567 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6242 6246) the Hoare annotation is: true [2023-11-29 04:58:59,568 INFO L895 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: (or (and (= |aws_string_bytes_#in~str.base| 0) (= aws_string_bytes_~str.base 0)) (and (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse1 (mod (select .cse0 8) 18446744073709551616))) (or (not (= (mod (select .cse0 (+ .cse1 16)) 256) 0)) (< 9223372036854775807 .cse1))))) (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse2 (mod (select .cse3 8) 18446744073709551616))) (or (< .cse2 9223372036854775808) (not (= (mod (select .cse3 (+ .cse2 (- 18446744073709551600))) 256) 0))))))) (and (= |aws_string_bytes_#in~str.offset| aws_string_bytes_~str.offset) (= |aws_string_bytes_#in~str.base| aws_string_bytes_~str.base))) [2023-11-29 04:58:59,568 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2023-11-29 04:58:59,568 INFO L895 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: (or (and (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse1 (mod (select .cse0 8) 18446744073709551616))) (or (not (= (mod (select .cse0 (+ .cse1 16)) 256) 0)) (< 9223372036854775807 .cse1))))) (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10| Int)) (let ((.cse3 (select |#memory_int#4| |v_ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base_BEFORE_CALL_10|))) (let ((.cse2 (mod (select .cse3 8) 18446744073709551616))) (or (< .cse2 9223372036854775808) (not (= (mod (select .cse3 (+ .cse2 (- 18446744073709551600))) 256) 0))))))) (and (= |aws_string_bytes_#in~str.offset| aws_string_bytes_~str.offset) (= |aws_string_bytes_#in~str.base| aws_string_bytes_~str.base))) [2023-11-29 04:58:59,568 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-29 04:58:59,568 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-29 04:58:59,568 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-29 04:58:59,568 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-29 04:58:59,568 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6889 6891) the Hoare annotation is: true [2023-11-29 04:58:59,568 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2023-11-29 04:58:59,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:58:59,569 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-29 04:58:59,569 INFO L899 garLoopResultBuilder]: For program point L9538-1(line 9538) no Hoare annotation was computed. [2023-11-29 04:58:59,569 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-29 04:58:59,569 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse16 (select .cse0 8)) (.cse6 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|))) (let ((.cse2 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse17 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse16 .cse17) (= (select .cse6 0) .cse17))))) (.cse3 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse10 (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) (.cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0)) (.cse12 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|)) (.cse1 (mod .cse16 18446744073709551616)) (.cse13 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0)) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (.cse8 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|))) (or (let ((.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8))) (and (= (mod (select .cse0 (+ 16 .cse1)) 256) 0) .cse2 (= 16 |ULTIMATE.start_assert_bytes_match_~a#1.offset|) (= 16 (select .cse3 .cse4)) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (let ((.cse5 (select .cse6 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (= 16 |ULTIMATE.start_assert_bytes_match_~b#1.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26| Int)) (let ((.cse7 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| 8)))) (and (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= .cse7 (select .cse8 .cse4))))) .cse9 (<= |ULTIMATE.start_assert_bytes_match_~len#1| (+ 15 .cse10)) .cse11 .cse12 .cse13 .cse14)) (let ((.cse15 (select .cse8 8))) (and .cse2 (= 16 (select .cse3 8)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| .cse15) (<= |ULTIMATE.start_assert_bytes_match_~len#1| .cse10) (= (mod (select .cse0 16) 256) 0) .cse9 .cse11 .cse12 (not (= .cse15 0)) (= 0 .cse1) .cse13 .cse14)))))) [2023-11-29 04:58:59,569 INFO L899 garLoopResultBuilder]: For program point L9518-1(line 9518) no Hoare annotation was computed. [2023-11-29 04:58:59,569 INFO L899 garLoopResultBuilder]: For program point L8240-2(line 8240) no Hoare annotation was computed. [2023-11-29 04:58:59,570 INFO L895 garLoopResultBuilder]: At program point L8240-1(line 8240) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse17 (select (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0)) (.cse20 (select .cse0 8))) (let ((.cse2 (= 16 |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1345#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse6 (= .cse17 .cse20)) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0))) (.cse8 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse9 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 16)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1345#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|)) (.cse11 (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|)) (.cse12 (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0)) (.cse1 (mod .cse20 18446744073709551616)) (.cse14 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0)) (.cse15 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (.cse16 (= 16 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset|)) (.cse18 (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.offset| 0)) (.cse19 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| .cse20))) (or (and (= (mod (select .cse0 (+ 16 .cse1)) 256) 0) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse17 (+ (* 18446744073709551616 (div .cse17 18446744073709551616)) 15)) .cse18 .cse19) (and .cse2 .cse3 .cse4 .cse5 (= (select .cse0 16) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 .cse1) .cse14 .cse15 .cse16 .cse18 .cse19))))) [2023-11-29 04:58:59,570 INFO L895 garLoopResultBuilder]: At program point L8240(line 8240) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse2 (select (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0)) (.cse1 (select .cse0 8))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (= 16 |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1345#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= .cse2 .cse1) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 16) (= |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1345#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (or (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616)))) (= (select .cse0 16) 0)) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= 16 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset|) (<= .cse2 (+ (* 18446744073709551616 (div .cse2 18446744073709551616)) 15)) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| .cse1)))) [2023-11-29 04:58:59,570 INFO L899 garLoopResultBuilder]: For program point L8236-1(line 8236) no Hoare annotation was computed. [2023-11-29 04:58:59,570 INFO L895 garLoopResultBuilder]: At program point L8236(line 8236) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base|))) (let ((.cse0 (select .cse1 8)) (.cse2 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (and (= 16 |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1345#1.offset|) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (<= .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 15)) (= (mod (select .cse1 (+ 16 (mod .cse0 18446744073709551616))) 256) 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1345#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (or (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| 18446744073709551616)))) (= (select .cse2 16) 0)) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= 16 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| (select .cse2 8))))) [2023-11-29 04:58:59,571 INFO L895 garLoopResultBuilder]: At program point L9518(line 9518) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base|))) (let ((.cse0 (select .cse1 8))) (and (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (<= .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 15)) (= (mod (select .cse1 (+ 16 (mod .cse0 18446744073709551616))) 256) 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (let ((.cse2 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (or (= (select .cse2 16) 0) (let ((.cse3 (select .cse2 8))) (< .cse3 (+ 18446744073709551616 (* (div (+ (- 1) .cse3) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.offset| 0)))) [2023-11-29 04:58:59,571 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:58:59,571 INFO L895 garLoopResultBuilder]: At program point L9541(line 9541) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8)) (.cse10 (select .cse1 8)) (.cse0 (select (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 0))) (let ((.cse3 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse12 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse10 .cse12) (= .cse0 .cse12))))) (.cse4 (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8))) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| .cse11)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0)) (.cse8 (not (= .cse11 0))) (.cse2 (mod .cse10 18446744073709551616)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0))) (or (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= (mod (select .cse1 (+ 16 .cse2)) 256) 0) .cse3 .cse4 .cse5 (<= .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 15)) .cse6 .cse7 .cse8 .cse9) (and .cse3 .cse4 .cse5 (= (select .cse1 16) 0) .cse6 .cse7 .cse8 (= 0 .cse2) .cse9))))) [2023-11-29 04:58:59,571 INFO L895 garLoopResultBuilder]: At program point L9541-1(line 9541) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse3 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8)) (.cse7 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse2 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse1 .cse2) (= (select .cse3 0) .cse2)))) (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4)) (let ((.cse5 (select .cse3 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26| Int)) (let ((.cse6 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| 8)))) (and (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= .cse6 (select .cse7 .cse4))))) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (not (= (select .cse7 8) 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~ret1356#1| 1) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0)))) [2023-11-29 04:58:59,571 INFO L899 garLoopResultBuilder]: For program point L9541-2(line 9541) no Hoare annotation was computed. [2023-11-29 04:58:59,571 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-29 04:58:59,572 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse3 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse2 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse1 .cse2) (= (select .cse3 0) .cse2)))) (= 16 |ULTIMATE.start_assert_bytes_match_~a#1.offset|) (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4)) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (let ((.cse5 (select .cse3 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (= 16 |ULTIMATE.start_assert_bytes_match_~b#1.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26| Int)) (let ((.cse6 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| 8)))) (and (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= .cse6 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4))))) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (+ 15 (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))))) [2023-11-29 04:58:59,572 INFO L895 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse3 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse4 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~mem1359#1.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse2 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse1 .cse2) (= (select .cse3 0) .cse2)))) (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| .cse4) (let ((.cse5 (select .cse3 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (= 16 |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~mem1359#1.offset|) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (not (= .cse4 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0)))) [2023-11-29 04:58:59,572 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2023-11-29 04:58:59,572 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-29 04:58:59,572 INFO L895 garLoopResultBuilder]: At program point L9517(line 9517) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (let ((.cse0 (select (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base|) 8))) (<= .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 15))) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (or (= (select .cse1 16) 0) (let ((.cse2 (select .cse1 8))) (< .cse2 (+ 18446744073709551616 (* (div (+ (- 1) .cse2) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.offset| 0)) [2023-11-29 04:58:59,572 INFO L895 garLoopResultBuilder]: At program point L9517-1(line 9517) the Hoare annotation is: (let ((.cse2 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base|))) (let ((.cse0 (select .cse2 8))) (and (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (<= .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 15)) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (let ((.cse1 (= (mod (select .cse2 (+ 16 (mod .cse0 18446744073709551616))) 256) 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1344#1| 1)) (and (= |ULTIMATE.start_aws_byte_cursor_from_string_#t~ret1344#1| 0) (not .cse1)))) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (let ((.cse3 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (or (= (select .cse3 16) 0) (let ((.cse4 (select .cse3 8))) (< .cse4 (+ 18446744073709551616 (* (div (+ (- 1) .cse4) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_string_~src#1.offset| 0)))) [2023-11-29 04:58:59,572 INFO L899 garLoopResultBuilder]: For program point L9517-2(line 9517) no Hoare annotation was computed. [2023-11-29 04:58:59,572 INFO L899 garLoopResultBuilder]: For program point L9542-1(line 9542) no Hoare annotation was computed. [2023-11-29 04:58:59,573 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse3 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse2 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse1 .cse2) (= (select .cse3 0) .cse2)))) (= 16 |ULTIMATE.start_assert_bytes_match_~a#1.offset|) (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4)) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (let ((.cse5 (select .cse3 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (= 16 |ULTIMATE.start_assert_bytes_match_~b#1.offset|) (= |ULTIMATE.start_assert_bytes_match_#t~mem594#1| |ULTIMATE.start_assert_bytes_match_#t~mem593#1|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26| Int)) (let ((.cse6 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| 8)))) (and (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= .cse6 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4))))) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (+ 15 (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (<= |ULTIMATE.start_assert_bytes_match_~i~4#1| (+ 14 (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~i~4#1| 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))))) [2023-11-29 04:58:59,573 INFO L895 garLoopResultBuilder]: At program point L9540(line 9540) the Hoare annotation is: (let ((.cse1 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8)) (.cse10 (select .cse1 8)) (.cse0 (select (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 0))) (let ((.cse3 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse12 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse10 .cse12) (= .cse0 .cse12))))) (.cse4 (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8))) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| .cse11)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0)) (.cse8 (not (= .cse11 0))) (.cse2 (mod .cse10 18446744073709551616)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0))) (or (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (= (mod (select .cse1 (+ 16 .cse2)) 256) 0) .cse3 .cse4 .cse5 (<= .cse0 (+ (* 18446744073709551616 (div .cse0 18446744073709551616)) 15)) .cse6 .cse7 .cse8 .cse9) (and .cse3 .cse4 .cse5 (= (select .cse1 16) 0) .cse6 .cse7 .cse8 (= 0 .cse2) .cse9))))) [2023-11-29 04:58:59,573 INFO L895 garLoopResultBuilder]: At program point L9540-1(line 9540) the Hoare annotation is: (let ((.cse4 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse11 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8)) (.cse10 (select (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 0)) (.cse12 (select .cse4 8))) (let ((.cse8 (mod .cse12 18446744073709551616)) (.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~ret1355#1| 1)) (.cse1 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse13 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse12 .cse13) (= .cse10 .cse13))))) (.cse2 (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8))) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| .cse11)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0)) (.cse7 (not (= .cse11 0))) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= (select .cse4 16) 0) .cse5 .cse6 .cse7 (= 0 .cse8) .cse9) (and (<= .cse10 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse10) 18446744073709551616)))) (= (mod (select .cse4 (+ 16 .cse8)) 256) 0) .cse0 .cse1 .cse2 .cse3 (<= .cse10 (+ (* 18446744073709551616 (div .cse10 18446744073709551616)) 15)) .cse5 .cse6 .cse7 .cse9))))) [2023-11-29 04:58:59,573 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2023-11-29 04:58:59,573 INFO L899 garLoopResultBuilder]: For program point L9540-2(line 9540) no Hoare annotation was computed. [2023-11-29 04:58:59,574 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse3 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse2 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse1 .cse2) (= (select .cse3 0) .cse2)))) (= 16 |ULTIMATE.start_assert_bytes_match_~a#1.offset|) (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4)) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| 0)) (let ((.cse5 (select .cse3 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (= 16 |ULTIMATE.start_assert_bytes_match_~b#1.offset|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26| Int)) (let ((.cse6 (select (select |#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_26|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_26| 8)))) (and (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|) (= .cse6 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) .cse4))))) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (+ 15 (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))))) [2023-11-29 04:58:59,574 INFO L895 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: (let ((.cse0 (select |#memory_int#4| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base|))) (let ((.cse1 (select .cse0 8)) (.cse3 (select |#memory_int#2| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|)) (.cse4 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) 8))) (and (= (mod (select .cse0 (+ 16 (mod .cse1 18446744073709551616))) 256) 0) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23| Int)) (let ((.cse2 (select (select |#memory_int#2| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_23|) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_23|))) (and (= .cse1 .cse2) (= (select .cse3 0) .cse2)))) (= 16 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 8))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.base| .cse4) (= .cse1 |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~mem1358#1|) (let ((.cse5 (select .cse3 |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset|))) (<= .cse5 (+ (* 18446744073709551616 (div .cse5 18446744073709551616)) 15))) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~mem1358#1| |ULTIMATE.start_aws_byte_cursor_from_string_harness_#t~mem1357#1|) (not (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~#cursor~2#1.offset| 0) (not (= .cse4 0)) (= |ULTIMATE.start_aws_byte_cursor_from_string_harness_~str~3#1.offset| 0)))) [2023-11-29 04:58:59,574 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-29 04:58:59,576 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:59,577 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:58:59,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:58:59 BoogieIcfgContainer [2023-11-29 04:58:59,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:58:59,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:58:59,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:58:59,582 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:58:59,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:53:43" (3/4) ... [2023-11-29 04:58:59,584 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:58:59,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2023-11-29 04:58:59,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-29 04:58:59,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2023-11-29 04:58:59,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-29 04:58:59,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2023-11-29 04:58:59,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2023-11-29 04:58:59,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:58:59,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 04:58:59,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2023-11-29 04:58:59,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2023-11-29 04:58:59,606 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 136 nodes and edges [2023-11-29 04:58:59,609 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2023-11-29 04:58:59,611 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-11-29 04:58:59,612 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-29 04:58:59,614 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 04:58:59,616 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:58:59,617 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-29 04:58:59,619 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:59:00,311 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:59:00,311 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:59:00,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:59:00,312 INFO L158 Benchmark]: Toolchain (without parser) took 321389.20ms. Allocated memory was 157.3MB in the beginning and 805.3MB in the end (delta: 648.0MB). Free memory was 108.4MB in the beginning and 653.1MB in the end (delta: -544.6MB). Peak memory consumption was 538.2MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,312 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:59:00,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2794.69ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 107.7MB in the beginning and 128.7MB in the end (delta: -20.9MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 184.72ms. Allocated memory is still 216.0MB. Free memory was 127.6MB in the beginning and 116.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,312 INFO L158 Benchmark]: Boogie Preprocessor took 194.06ms. Allocated memory is still 216.0MB. Free memory was 116.1MB in the beginning and 100.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,313 INFO L158 Benchmark]: RCFGBuilder took 1373.29ms. Allocated memory is still 216.0MB. Free memory was 100.3MB in the beginning and 78.2MB in the end (delta: 22.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,313 INFO L158 Benchmark]: TraceAbstraction took 316105.75ms. Allocated memory was 216.0MB in the beginning and 805.3MB in the end (delta: 589.3MB). Free memory was 77.2MB in the beginning and 306.8MB in the end (delta: -229.6MB). Peak memory consumption was 427.4MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,313 INFO L158 Benchmark]: Witness Printer took 729.50ms. Allocated memory is still 805.3MB. Free memory was 306.8MB in the beginning and 653.1MB in the end (delta: -346.2MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2023-11-29 04:59:00,314 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2794.69ms. Allocated memory was 157.3MB in the beginning and 216.0MB in the end (delta: 58.7MB). Free memory was 107.7MB in the beginning and 128.7MB in the end (delta: -20.9MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 184.72ms. Allocated memory is still 216.0MB. Free memory was 127.6MB in the beginning and 116.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 194.06ms. Allocated memory is still 216.0MB. Free memory was 116.1MB in the beginning and 100.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1373.29ms. Allocated memory is still 216.0MB. Free memory was 100.3MB in the beginning and 78.2MB in the end (delta: 22.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 316105.75ms. Allocated memory was 216.0MB in the beginning and 805.3MB in the end (delta: 589.3MB). Free memory was 77.2MB in the beginning and 306.8MB in the end (delta: -229.6MB). Peak memory consumption was 427.4MB. Max. memory is 16.1GB. * Witness Printer took 729.50ms. Allocated memory is still 805.3MB. Free memory was 306.8MB in the beginning and 653.1MB in the end (delta: -346.2MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8253]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8253] - GenericResultAtLocation [Line: 8739]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8739-8750] * 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 316.0s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 143.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 97 mSolverCounterUnknown, 2373 SdHoareTripleChecker+Valid, 112.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2193 mSDsluCounter, 13753 SdHoareTripleChecker+Invalid, 109.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1020 IncrementalHoareTripleChecker+Unchecked, 12370 mSDsCounter, 1184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25650 IncrementalHoareTripleChecker+Invalid, 27951 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1184 mSolverCounterUnsat, 1383 mSDtfsCounter, 25650 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3148 GetRequests, 2263 SyntacticMatches, 89 SemanticMatches, 796 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 9674 ImplicationChecksByTransitivity, 84.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=16, InterpolantAutomatonStates: 423, 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, 23 MinimizatonAttempts, 117 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 213 PreInvPairs, 241 NumberOfFragments, 2612 HoareAnnotationTreeSize, 213 FomulaSimplifications, 3380 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 35 FomulaSimplificationsInter, 28895 FormulaSimplificationTreeSizeReductionInter, 28.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 9.1s SatisfiabilityAnalysisTime, 127.3s InterpolantComputationTime, 3658 NumberOfCodeBlocks, 3658 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3967 ConstructedInterpolants, 361 QuantifiedInterpolants, 26691 SizeOfPredicates, 242 NumberOfNonLiveVariables, 35435 ConjunctsInSsa, 727 ConjunctsInUnsatCore, 39 InterpolantComputations, 16 PerfectInterpolantSequences, 2804/3088 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 RESULT: Ultimate proved your program to be correct! [2023-11-29 04:59:00,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_536268f7-8524-4037-8091-2f868a3a6c6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE