./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/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 5c58e2434ae79fdf5f8dceab88ea2b6ad3f1a1a8bb44e2d930eaf759f64b3d29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:52:09,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:52:09,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 06:52:09,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:52:09,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:52:09,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:52:09,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:52:09,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:52:09,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:52:09,118 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:52:09,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:52:09,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:52:09,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:52:09,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:52:09,121 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:52:09,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:52:09,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:52:09,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:52:09,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:52:09,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:52:09,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:52:09,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:52:09,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:52:09,126 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:52:09,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:52:09,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:52:09,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:52:09,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:52:09,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:52:09,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:52:09,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:52:09,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:52:09,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:52:09,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:52:09,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:52:09,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:52:09,130 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:52:09,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:52:09,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:52:09,131 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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/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 -> 5c58e2434ae79fdf5f8dceab88ea2b6ad3f1a1a8bb44e2d930eaf759f64b3d29 [2023-11-29 06:52:09,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:52:09,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:52:09,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:52:09,385 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:52:09,385 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:52:09,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i [2023-11-29 06:52:12,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:52:12,567 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:52:12,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i [2023-11-29 06:52:12,600 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/data/e6912b76d/fd196ca265a748b8a6e3017f0ce6c921/FLAGa5dfe0ae0 [2023-11-29 06:52:12,616 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/data/e6912b76d/fd196ca265a748b8a6e3017f0ce6c921 [2023-11-29 06:52:12,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:52:12,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:52:12,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:52:12,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:52:12,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:52:12,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:52:12" (1/1) ... [2023-11-29 06:52:12,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5474ebc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:12, skipping insertion in model container [2023-11-29 06:52:12,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:52:12" (1/1) ... [2023-11-29 06:52:12,735 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:52:13,003 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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i[4499,4512] [2023-11-29 06:52:13,012 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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i[4559,4572] [2023-11-29 06:52:14,033 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,034 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,035 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,036 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,038 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,054 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,055 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,057 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,058 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,577 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 06:52:14,579 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 06:52:14,580 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 06:52:14,581 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 06:52:14,583 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 06:52:14,606 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 06:52:14,609 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 06:52:14,610 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 06:52:14,612 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 06:52:14,613 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 06:52:14,895 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,895 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:14,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:52:14,961 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:52:14,976 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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i[4499,4512] [2023-11-29 06:52:14,977 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_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness.i[4559,4572] [2023-11-29 06:52:15,014 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,014 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,015 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,015 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,016 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,025 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,026 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,027 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,028 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,061 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 06:52:15,062 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 06:52:15,063 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 06:52:15,064 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 06:52:15,065 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 06:52:15,065 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 06:52:15,066 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 06:52:15,066 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 06:52:15,067 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 06:52:15,067 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 06:52:15,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8588] [2023-11-29 06:52:15,162 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,163 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 06:52:15,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:52:15,440 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,441 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,442 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:52:15,450 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:52:15,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15 WrapperNode [2023-11-29 06:52:15,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:52:15,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:52:15,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:52:15,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:52:15,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,594 INFO L138 Inliner]: procedures = 680, calls = 2274, calls flagged for inlining = 57, calls inlined = 5, statements flattened = 368 [2023-11-29 06:52:15,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:52:15,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:52:15,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:52:15,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:52:15,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,640 INFO L175 MemorySlicer]: Split 277 memory accesses to 4 slices as follows [2, 258, 5, 12]. 93 percent of accesses are in the largest equivalence class. The 263 initializations are split as follows [2, 256, 5, 0]. The 3 writes are split as follows [0, 0, 0, 3]. [2023-11-29 06:52:15,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:52:15,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:52:15,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:52:15,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:52:15,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (1/1) ... [2023-11-29 06:52:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:52:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:52:15,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:52:15,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:52:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-29 06:52:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-29 06:52:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_ignore_case [2023-11-29 06:52:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_ignore_case [2023-11-29 06:52:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2023-11-29 06:52:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2023-11-29 06:52:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-29 06:52:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 06:52:15,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:52:15,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:52:15,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-29 06:52:15,777 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-29 06:52:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:52:15,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:52:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 06:52:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 06:52:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 06:52:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 06:52:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-29 06:52:15,778 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-29 06:52:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 06:52:15,778 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:52:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:52:16,016 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:52:16,018 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:52:16,364 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:52:16,436 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:52:16,436 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:52:16,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:52:16 BoogieIcfgContainer [2023-11-29 06:52:16,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:52:16,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:52:16,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:52:16,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:52:16,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:52:12" (1/3) ... [2023-11-29 06:52:16,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d522ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:52:16, skipping insertion in model container [2023-11-29 06:52:16,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:52:15" (2/3) ... [2023-11-29 06:52:16,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d522ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:52:16, skipping insertion in model container [2023-11-29 06:52:16,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:52:16" (3/3) ... [2023-11-29 06:52:16,446 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_ignore_case_harness.i [2023-11-29 06:52:16,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:52:16,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:52:16,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:52:16,531 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;@34d2ace7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:52:16,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:52:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.320754716981132) internal successors, (70), 54 states have internal predecessors, (70), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:52:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 06:52:16,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:16,549 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 06:52:16,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:16,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash 113032431, now seen corresponding path program 1 times [2023-11-29 06:52:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813304499] [2023-11-29 06:52:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:16,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:52:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:16,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:52:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:52:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 06:52:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:52:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 06:52:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813304499] [2023-11-29 06:52:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813304499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:17,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:17,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:52:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539432363] [2023-11-29 06:52:17,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:17,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:52:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:52:17,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:52:17,056 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.320754716981132) internal successors, (70), 54 states have internal predecessors, (70), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 06:52:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:17,128 INFO L93 Difference]: Finished difference Result 170 states and 238 transitions. [2023-11-29 06:52:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:52:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-11-29 06:52:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:17,140 INFO L225 Difference]: With dead ends: 170 [2023-11-29 06:52:17,140 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 06:52:17,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:52:17,148 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:17,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:52:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 06:52:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 06:52:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 52 states have internal predecessors, (64), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 06:52:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2023-11-29 06:52:17,196 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 43 [2023-11-29 06:52:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:17,198 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2023-11-29 06:52:17,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 06:52:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2023-11-29 06:52:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 06:52:17,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:17,202 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-29 06:52:17,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:52:17,203 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:17,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1740563665, now seen corresponding path program 1 times [2023-11-29 06:52:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026832191] [2023-11-29 06:52:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:52:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 06:52:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 06:52:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 06:52:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:52:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 06:52:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026832191] [2023-11-29 06:52:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026832191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:52:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230209464] [2023-11-29 06:52:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:52:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:17,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:52:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:52:17,607 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 06:52:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:17,711 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2023-11-29 06:52:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:52:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-11-29 06:52:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:17,714 INFO L225 Difference]: With dead ends: 127 [2023-11-29 06:52:17,715 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 06:52:17,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:52:17,718 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 10 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:17,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:52:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 06:52:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 06:52:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 06:52:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2023-11-29 06:52:17,734 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 43 [2023-11-29 06:52:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:17,734 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2023-11-29 06:52:17,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 06:52:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2023-11-29 06:52:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 06:52:17,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:17,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:52:17,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:52:17,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:17,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 59842997, now seen corresponding path program 1 times [2023-11-29 06:52:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172756746] [2023-11-29 06:52:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 06:52:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 06:52:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 06:52:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172756746] [2023-11-29 06:52:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172756746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:18,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 06:52:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321898260] [2023-11-29 06:52:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:52:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:52:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:52:18,813 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-29 06:52:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:19,403 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2023-11-29 06:52:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:52:19,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 72 [2023-11-29 06:52:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:19,410 INFO L225 Difference]: With dead ends: 116 [2023-11-29 06:52:19,411 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 06:52:19,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:52:19,413 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 100 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:19,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 532 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:52:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 06:52:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 06:52:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 06:52:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2023-11-29 06:52:19,428 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 72 [2023-11-29 06:52:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:19,428 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2023-11-29 06:52:19,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-29 06:52:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2023-11-29 06:52:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 06:52:19,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:19,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:52:19,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:52:19,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:19,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1740677014, now seen corresponding path program 1 times [2023-11-29 06:52:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:19,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625215192] [2023-11-29 06:52:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:19,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 06:52:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-29 06:52:20,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625215192] [2023-11-29 06:52:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625215192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:20,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:52:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257154283] [2023-11-29 06:52:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:20,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:52:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:52:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:52:20,455 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 06:52:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:21,114 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2023-11-29 06:52:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:52:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) Word has length 80 [2023-11-29 06:52:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:21,117 INFO L225 Difference]: With dead ends: 112 [2023-11-29 06:52:21,117 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 06:52:21,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:52:21,119 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 81 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:21,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 408 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:52:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 06:52:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-11-29 06:52:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:52:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2023-11-29 06:52:21,136 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 80 [2023-11-29 06:52:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:21,137 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2023-11-29 06:52:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-29 06:52:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2023-11-29 06:52:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 06:52:21,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:21,139 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:52:21,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:52:21,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:21,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1921594576, now seen corresponding path program 1 times [2023-11-29 06:52:21,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122839150] [2023-11-29 06:52:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:52:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-29 06:52:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:21,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122839150] [2023-11-29 06:52:21,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122839150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:21,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:52:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496846496] [2023-11-29 06:52:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:21,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:52:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:52:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:52:21,641 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 06:52:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:22,034 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2023-11-29 06:52:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:52:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 81 [2023-11-29 06:52:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:22,037 INFO L225 Difference]: With dead ends: 126 [2023-11-29 06:52:22,037 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 06:52:22,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:52:22,039 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:22,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 229 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:52:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 06:52:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 06:52:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.196078431372549) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 06:52:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2023-11-29 06:52:22,053 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 81 [2023-11-29 06:52:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:22,054 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2023-11-29 06:52:22,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-29 06:52:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2023-11-29 06:52:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 06:52:22,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:22,056 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:52:22,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:52:22,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:22,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash -742889769, now seen corresponding path program 1 times [2023-11-29 06:52:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866588625] [2023-11-29 06:52:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:35,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:52:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:37,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:52:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 06:52:38,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866588625] [2023-11-29 06:52:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866588625] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:52:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639706665] [2023-11-29 06:52:38,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:38,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:52:38,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:52:38,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:52:38,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:52:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:38,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 101 conjunts are in the unsatisfiable core [2023-11-29 06:52:38,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:52:38,970 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 06:52:42,654 INFO L349 Elim1Store]: treesize reduction 168, result has 24.0 percent of original size [2023-11-29 06:52:42,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 220 treesize of output 180 [2023-11-29 06:52:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 06:52:43,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:52:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639706665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:52:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [29] total 51 [2023-11-29 06:52:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128537540] [2023-11-29 06:52:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:43,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 06:52:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 06:52:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 06:52:43,534 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:45,930 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2023-11-29 06:52:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 06:52:45,930 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 6 states have call successors, (14) Word has length 88 [2023-11-29 06:52:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:45,933 INFO L225 Difference]: With dead ends: 125 [2023-11-29 06:52:45,933 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 06:52:45,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=238, Invalid=3794, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 06:52:45,935 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:45,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1500 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 06:52:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 06:52:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2023-11-29 06:52:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 30 states have call successors, (30), 12 states have call predecessors, (30), 14 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2023-11-29 06:52:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2023-11-29 06:52:45,955 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 88 [2023-11-29 06:52:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:45,956 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2023-11-29 06:52:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 7 states have call successors, (15), 3 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2023-11-29 06:52:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 06:52:45,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:45,957 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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 06:52:45,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:52:46,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:52:46,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:46,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:46,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1032117593, now seen corresponding path program 1 times [2023-11-29 06:52:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:46,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836298034] [2023-11-29 06:52:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:52:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:52:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 06:52:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836298034] [2023-11-29 06:52:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836298034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:46,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:46,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:52:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716043215] [2023-11-29 06:52:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:46,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:52:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:52:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:52:46,810 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 06:52:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:47,433 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2023-11-29 06:52:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:52:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 88 [2023-11-29 06:52:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:47,435 INFO L225 Difference]: With dead ends: 164 [2023-11-29 06:52:47,435 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 06:52:47,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:52:47,437 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 95 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:47,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 544 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:52:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 06:52:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2023-11-29 06:52:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 82 states have internal predecessors, (93), 30 states have call successors, (30), 12 states have call predecessors, (30), 16 states have return successors, (38), 29 states have call predecessors, (38), 28 states have call successors, (38) [2023-11-29 06:52:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 161 transitions. [2023-11-29 06:52:47,456 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 161 transitions. Word has length 88 [2023-11-29 06:52:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:47,456 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 161 transitions. [2023-11-29 06:52:47,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 06:52:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 161 transitions. [2023-11-29 06:52:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 06:52:47,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:47,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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 06:52:47,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:52:47,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:47,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1712175963, now seen corresponding path program 1 times [2023-11-29 06:52:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932062174] [2023-11-29 06:52:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:52:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:52:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 06:52:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:47,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932062174] [2023-11-29 06:52:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932062174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:47,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:47,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 06:52:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048439849] [2023-11-29 06:52:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:47,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:52:47,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:47,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:52:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:52:47,931 INFO L87 Difference]: Start difference. First operand 124 states and 161 transitions. Second operand has 14 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-29 06:52:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:48,526 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2023-11-29 06:52:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:52:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 88 [2023-11-29 06:52:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:48,528 INFO L225 Difference]: With dead ends: 178 [2023-11-29 06:52:48,528 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 06:52:48,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-29 06:52:48,529 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:48,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 530 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:52:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 06:52:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2023-11-29 06:52:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 80 states have internal predecessors, (92), 29 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (34), 28 states have call predecessors, (34), 27 states have call successors, (34) [2023-11-29 06:52:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2023-11-29 06:52:48,546 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 88 [2023-11-29 06:52:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:48,546 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2023-11-29 06:52:48,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-29 06:52:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2023-11-29 06:52:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 06:52:48,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:48,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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 06:52:48,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:52:48,548 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:48,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash -876903275, now seen corresponding path program 2 times [2023-11-29 06:52:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85001073] [2023-11-29 06:52:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:52:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:52:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 06:52:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85001073] [2023-11-29 06:52:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85001073] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:52:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991742788] [2023-11-29 06:52:49,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:52:49,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:52:49,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:52:49,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:52:49,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:52:49,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:52:49,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:52:49,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 06:52:49,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:52:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 06:52:49,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:52:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991742788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:52:49,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 30 [2023-11-29 06:52:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053600519] [2023-11-29 06:52:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:49,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:52:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:52:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2023-11-29 06:52:49,682 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:50,008 INFO L93 Difference]: Finished difference Result 216 states and 279 transitions. [2023-11-29 06:52:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:52:50,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 88 [2023-11-29 06:52:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:50,010 INFO L225 Difference]: With dead ends: 216 [2023-11-29 06:52:50,010 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 06:52:50,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 06:52:50,012 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:50,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 962 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:52:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 06:52:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2023-11-29 06:52:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.2) internal successors, (96), 84 states have internal predecessors, (96), 30 states have call successors, (30), 12 states have call predecessors, (30), 16 states have return successors, (37), 30 states have call predecessors, (37), 28 states have call successors, (37) [2023-11-29 06:52:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2023-11-29 06:52:50,030 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 88 [2023-11-29 06:52:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:50,030 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2023-11-29 06:52:50,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2023-11-29 06:52:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 06:52:50,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:50,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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 06:52:50,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:52:50,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:52:50,232 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:50,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash -814863661, now seen corresponding path program 2 times [2023-11-29 06:52:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878465669] [2023-11-29 06:52:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:52:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:52:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 06:52:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878465669] [2023-11-29 06:52:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878465669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:52:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431989442] [2023-11-29 06:52:50,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:52:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:52:50,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:52:50,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:52:50,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:52:50,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:52:50,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:52:50,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 06:52:50,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:52:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 06:52:51,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:52:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431989442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:52:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 26 [2023-11-29 06:52:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656331444] [2023-11-29 06:52:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:51,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:52:51,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:51,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:52:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:52:51,206 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:51,479 INFO L93 Difference]: Finished difference Result 251 states and 331 transitions. [2023-11-29 06:52:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:52:51,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 88 [2023-11-29 06:52:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:51,481 INFO L225 Difference]: With dead ends: 251 [2023-11-29 06:52:51,481 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 06:52:51,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:52:51,482 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 46 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:51,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 916 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:52:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 06:52:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2023-11-29 06:52:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.188235294117647) internal successors, (101), 90 states have internal predecessors, (101), 33 states have call successors, (33), 12 states have call predecessors, (33), 16 states have return successors, (43), 32 states have call predecessors, (43), 31 states have call successors, (43) [2023-11-29 06:52:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2023-11-29 06:52:51,495 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 88 [2023-11-29 06:52:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:51,495 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2023-11-29 06:52:51,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2023-11-29 06:52:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 06:52:51,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:51,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:52:51,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:52:51,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 06:52:51,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:51,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2054531665, now seen corresponding path program 1 times [2023-11-29 06:52:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048671324] [2023-11-29 06:52:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:52:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:52:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:52:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:52:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:52:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 06:52:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048671324] [2023-11-29 06:52:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048671324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:52:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:52:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:52:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894025416] [2023-11-29 06:52:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:52:52,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:52:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:52:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:52:52,176 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:52,623 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2023-11-29 06:52:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:52:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 89 [2023-11-29 06:52:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:52,624 INFO L225 Difference]: With dead ends: 164 [2023-11-29 06:52:52,624 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 06:52:52,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:52:52,625 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:52,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 387 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:52:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 06:52:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-29 06:52:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 90 states have internal predecessors, (100), 33 states have call successors, (33), 12 states have call predecessors, (33), 16 states have return successors, (43), 32 states have call predecessors, (43), 31 states have call successors, (43) [2023-11-29 06:52:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2023-11-29 06:52:52,638 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 89 [2023-11-29 06:52:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:52,638 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2023-11-29 06:52:52,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.923076923076923) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 06:52:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2023-11-29 06:52:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 06:52:52,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:52,640 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:52:52,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:52:52,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:52,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:52,640 INFO L85 PathProgramCache]: Analyzing trace with hash 711255766, now seen corresponding path program 1 times [2023-11-29 06:52:52,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19187767] [2023-11-29 06:52:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:52:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:52,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:52:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:52:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:52:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:52:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:52:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:52:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:52:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:52:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:52:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 06:52:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:52:53,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:52:53,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19187767] [2023-11-29 06:52:53,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19187767] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:52:53,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137699513] [2023-11-29 06:52:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:53,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:52:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:52:53,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:52:53,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:52:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:52:53,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 06:52:53,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:52:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 06:52:53,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:52:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 06:52:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137699513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:52:53,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:52:53,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 25 [2023-11-29 06:52:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636893508] [2023-11-29 06:52:53,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:52:53,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 06:52:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:52:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 06:52:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2023-11-29 06:52:53,739 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 25 states, 20 states have (on average 3.6) internal successors, (72), 19 states have internal predecessors, (72), 10 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) [2023-11-29 06:52:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:52:54,745 INFO L93 Difference]: Finished difference Result 243 states and 312 transitions. [2023-11-29 06:52:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 06:52:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 3.6) internal successors, (72), 19 states have internal predecessors, (72), 10 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) Word has length 113 [2023-11-29 06:52:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:52:54,747 INFO L225 Difference]: With dead ends: 243 [2023-11-29 06:52:54,747 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 06:52:54,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 06:52:54,749 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 122 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:52:54,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1095 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:52:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 06:52:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 129. [2023-11-29 06:52:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 86 states have internal predecessors, (95), 32 states have call successors, (32), 12 states have call predecessors, (32), 15 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2023-11-29 06:52:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2023-11-29 06:52:54,765 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 113 [2023-11-29 06:52:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:52:54,765 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2023-11-29 06:52:54,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 3.6) internal successors, (72), 19 states have internal predecessors, (72), 10 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) [2023-11-29 06:52:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2023-11-29 06:52:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 06:52:54,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:52:54,767 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-29 06:52:54,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:52:54,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 06:52:54,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:52:54,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:52:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2107049313, now seen corresponding path program 1 times [2023-11-29 06:52:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:52:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637914209] [2023-11-29 06:52:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:52:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:52:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:53:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:53:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:53:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:53:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:53:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:53:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:53:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 06:53:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637914209] [2023-11-29 06:53:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637914209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:53:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624532024] [2023-11-29 06:53:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:15,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:15,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:53:15,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:53:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:15,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 06:53:15,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:15,652 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 06:53:18,128 INFO L349 Elim1Store]: treesize reduction 168, result has 24.0 percent of original size [2023-11-29 06:53:18,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 220 treesize of output 180 [2023-11-29 06:53:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 06:53:18,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:53:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 06:53:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624532024] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:53:31,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:53:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 19] total 68 [2023-11-29 06:53:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286321949] [2023-11-29 06:53:31,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:53:31,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-29 06:53:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:31,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-29 06:53:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4311, Unknown=2, NotChecked=0, Total=4556 [2023-11-29 06:53:31,511 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 68 states, 51 states have (on average 2.392156862745098) internal successors, (122), 54 states have internal predecessors, (122), 22 states have call successors, (42), 6 states have call predecessors, (42), 14 states have return successors, (42), 23 states have call predecessors, (42), 20 states have call successors, (42) [2023-11-29 06:53:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:47,673 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2023-11-29 06:53:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-29 06:53:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 51 states have (on average 2.392156862745098) internal successors, (122), 54 states have internal predecessors, (122), 22 states have call successors, (42), 6 states have call predecessors, (42), 14 states have return successors, (42), 23 states have call predecessors, (42), 20 states have call successors, (42) Word has length 101 [2023-11-29 06:53:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:47,677 INFO L225 Difference]: With dead ends: 207 [2023-11-29 06:53:47,677 INFO L226 Difference]: Without dead ends: 201 [2023-11-29 06:53:47,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3254 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=930, Invalid=13827, Unknown=5, NotChecked=0, Total=14762 [2023-11-29 06:53:47,683 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 220 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 4149 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 4374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 4149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:47,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1426 Invalid, 4374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 4149 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-11-29 06:53:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-29 06:53:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 160. [2023-11-29 06:53:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 100 states have (on average 1.14) internal successors, (114), 105 states have internal predecessors, (114), 38 states have call successors, (38), 19 states have call predecessors, (38), 21 states have return successors, (43), 35 states have call predecessors, (43), 36 states have call successors, (43) [2023-11-29 06:53:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2023-11-29 06:53:47,713 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 101 [2023-11-29 06:53:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:47,713 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2023-11-29 06:53:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 51 states have (on average 2.392156862745098) internal successors, (122), 54 states have internal predecessors, (122), 22 states have call successors, (42), 6 states have call predecessors, (42), 14 states have return successors, (42), 23 states have call predecessors, (42), 20 states have call successors, (42) [2023-11-29 06:53:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2023-11-29 06:53:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 06:53:47,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:47,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:47,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:53:47,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:47,916 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:53:47,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -412910621, now seen corresponding path program 1 times [2023-11-29 06:53:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:47,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302972832] [2023-11-29 06:53:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:53:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:53:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:53:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:53:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:53:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:53:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:53:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 06:53:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302972832] [2023-11-29 06:53:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302972832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-29 06:53:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772196976] [2023-11-29 06:53:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:48,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:53:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:53:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:53:48,512 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 8 states have call predecessors, (16), 5 states have call successors, (16) [2023-11-29 06:53:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:49,287 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2023-11-29 06:53:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:53:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 8 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2023-11-29 06:53:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:49,289 INFO L225 Difference]: With dead ends: 171 [2023-11-29 06:53:49,289 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 06:53:49,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-11-29 06:53:49,290 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:49,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 539 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:53:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 06:53:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2023-11-29 06:53:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 103 states have internal predecessors, (111), 38 states have call successors, (38), 19 states have call predecessors, (38), 21 states have return successors, (43), 35 states have call predecessors, (43), 36 states have call successors, (43) [2023-11-29 06:53:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2023-11-29 06:53:49,320 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 101 [2023-11-29 06:53:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:49,320 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2023-11-29 06:53:49,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 8 states have call predecessors, (16), 5 states have call successors, (16) [2023-11-29 06:53:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2023-11-29 06:53:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-29 06:53:49,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:49,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:49,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:53:49,322 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:53:49,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 267147749, now seen corresponding path program 1 times [2023-11-29 06:53:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152450750] [2023-11-29 06:53:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:53:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:53:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:53:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:53:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:53:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:53:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:53:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 06:53:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152450750] [2023-11-29 06:53:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152450750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 06:53:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096772758] [2023-11-29 06:53:49,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:49,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:53:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:49,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:53:49,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:53:49,916 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 8 states have call predecessors, (16), 5 states have call successors, (16) [2023-11-29 06:53:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:50,610 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2023-11-29 06:53:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:53:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 8 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2023-11-29 06:53:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:50,612 INFO L225 Difference]: With dead ends: 171 [2023-11-29 06:53:50,612 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 06:53:50,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:53:50,613 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 83 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:50,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 491 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:53:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 06:53:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2023-11-29 06:53:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.10989010989011) internal successors, (101), 94 states have internal predecessors, (101), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (40), 34 states have call predecessors, (40), 35 states have call successors, (40) [2023-11-29 06:53:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2023-11-29 06:53:50,645 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 101 [2023-11-29 06:53:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:50,646 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2023-11-29 06:53:50,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 8 states have call predecessors, (16), 5 states have call successors, (16) [2023-11-29 06:53:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2023-11-29 06:53:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:53:50,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:50,647 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:50,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:53:50,647 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:53:50,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1577141576, now seen corresponding path program 1 times [2023-11-29 06:53:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:50,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426017699] [2023-11-29 06:53:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:53:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:53:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:53:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:53:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 06:53:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:53:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 06:53:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-29 06:53:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426017699] [2023-11-29 06:53:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426017699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:53:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050023620] [2023-11-29 06:53:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:50,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:53:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:50,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:53:50,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:53:50,991 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 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 06:53:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:51,393 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2023-11-29 06:53:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:53:51,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 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 105 [2023-11-29 06:53:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:51,394 INFO L225 Difference]: With dead ends: 177 [2023-11-29 06:53:51,394 INFO L226 Difference]: Without dead ends: 147 [2023-11-29 06:53:51,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:53:51,395 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:51,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 314 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:53:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-29 06:53:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-11-29 06:53:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 94 states have internal predecessors, (99), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (40), 34 states have call predecessors, (40), 35 states have call successors, (40) [2023-11-29 06:53:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2023-11-29 06:53:51,421 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 105 [2023-11-29 06:53:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:51,421 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2023-11-29 06:53:51,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 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 06:53:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2023-11-29 06:53:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 06:53:51,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:51,423 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:51,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:53:51,423 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:53:51,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1872551637, now seen corresponding path program 1 times [2023-11-29 06:53:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684852386] [2023-11-29 06:53:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:53:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:53:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:53:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:53:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 06:53:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:53:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 06:53:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-29 06:53:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684852386] [2023-11-29 06:53:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684852386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 06:53:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935004419] [2023-11-29 06:53:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:52,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:53:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:53:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:53:52,389 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-29 06:53:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:53,165 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2023-11-29 06:53:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:53:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2023-11-29 06:53:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:53,168 INFO L225 Difference]: With dead ends: 185 [2023-11-29 06:53:53,168 INFO L226 Difference]: Without dead ends: 151 [2023-11-29 06:53:53,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:53:53,169 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 97 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:53,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 550 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:53:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-29 06:53:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-11-29 06:53:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 96 states have internal predecessors, (102), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (39), 36 states have call predecessors, (39), 36 states have call successors, (39) [2023-11-29 06:53:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2023-11-29 06:53:53,204 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 107 [2023-11-29 06:53:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:53,205 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2023-11-29 06:53:53,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-29 06:53:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2023-11-29 06:53:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 06:53:53,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:53,206 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2023-11-29 06:53:53,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:53:53,206 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:53:53,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1368592782, now seen corresponding path program 1 times [2023-11-29 06:53:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208846322] [2023-11-29 06:53:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 06:53:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:53:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 06:53:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:53:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:53:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:53:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:53:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 06:53:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-29 06:53:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:54,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208846322] [2023-11-29 06:53:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208846322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:53:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:53:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-29 06:53:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390933343] [2023-11-29 06:53:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:53:54,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:53:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:53:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:53:54,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:53:54,869 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 17 states, 14 states have (on average 3.0) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-29 06:53:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:53:55,740 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2023-11-29 06:53:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:53:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.0) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2023-11-29 06:53:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:53:55,741 INFO L225 Difference]: With dead ends: 153 [2023-11-29 06:53:55,741 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 06:53:55,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2023-11-29 06:53:55,742 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:53:55,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 517 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:53:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 06:53:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-11-29 06:53:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 27 states have call successors, (27), 14 states have call predecessors, (27), 15 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2023-11-29 06:53:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2023-11-29 06:53:55,759 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 107 [2023-11-29 06:53:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:53:55,759 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2023-11-29 06:53:55,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.0) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-29 06:53:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2023-11-29 06:53:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 06:53:55,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:53:55,760 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:53:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:53:55,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:53:55,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:53:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1698309618, now seen corresponding path program 1 times [2023-11-29 06:53:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:53:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302451125] [2023-11-29 06:53:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:53:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:53:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:53:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:53:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:53:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:53:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:53:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:53:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:53:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:53:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:53:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:53:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:53:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:53:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-11-29 06:53:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:53:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302451125] [2023-11-29 06:53:59,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302451125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:53:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209303243] [2023-11-29 06:53:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:53:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:53:59,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:53:59,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:53:59,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:53:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:53:59,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 161 conjunts are in the unsatisfiable core [2023-11-29 06:53:59,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:53:59,768 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 06:54:04,999 INFO L349 Elim1Store]: treesize reduction 216, result has 26.3 percent of original size [2023-11-29 06:54:04,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 191 treesize of output 191 [2023-11-29 06:54:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 11 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 06:54:05,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:54:23,737 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| Int)) (let ((.cse0 (select |c_#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base_BEFORE_CALL_29|))) (let ((.cse1 (mod (select .cse0 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| 8)) 18446744073709551616))) (or (= (mod (select .cse0 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| (- 18446744073709551600) .cse1)) 256) 0) (= (mod (select .cse0 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| 16 .cse1)) 256) 0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| Int)) (let ((.cse3 (select |c_#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base_BEFORE_CALL_29|))) (let ((.cse2 (mod (select .cse3 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| 8)) 18446744073709551616))) (or (< .cse2 9223372036854775808) (= (mod (select .cse3 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| (- 18446744073709551600) .cse2)) 256) 0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| Int)) (let ((.cse5 (select |c_#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base_BEFORE_CALL_29|))) (let ((.cse4 (mod (select .cse5 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| 8)) 18446744073709551616))) (or (< 9223372036854775807 .cse4) (= (mod (select .cse5 (+ |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset_BEFORE_CALL_31| 16 .cse4)) 256) 0)))))) (= (mod |c_aws_array_eq_ignore_case_#in~len_b| 18446744073709551616) (mod |c_aws_array_eq_ignore_case_#in~len_a| 18446744073709551616))) is different from false [2023-11-29 06:54:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209303243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:54:24,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:54:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 54 [2023-11-29 06:54:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959979727] [2023-11-29 06:54:24,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:54:24,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 06:54:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:54:24,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 06:54:24,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=4155, Unknown=4, NotChecked=130, Total=4556 [2023-11-29 06:54:24,256 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 54 states, 42 states have (on average 2.357142857142857) internal successors, (99), 44 states have internal predecessors, (99), 16 states have call successors, (30), 5 states have call predecessors, (30), 12 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) [2023-11-29 06:54:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:54:32,692 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2023-11-29 06:54:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-11-29 06:54:32,693 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 42 states have (on average 2.357142857142857) internal successors, (99), 44 states have internal predecessors, (99), 16 states have call successors, (30), 5 states have call predecessors, (30), 12 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) Word has length 132 [2023-11-29 06:54:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:54:32,694 INFO L225 Difference]: With dead ends: 153 [2023-11-29 06:54:32,694 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 06:54:32,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=783, Invalid=10559, Unknown=4, NotChecked=210, Total=11556 [2023-11-29 06:54:32,698 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 123 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 71 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:54:32,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 853 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2368 Invalid, 7 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 06:54:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 06:54:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2023-11-29 06:54:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 80 states have internal predecessors, (84), 27 states have call successors, (27), 18 states have call predecessors, (27), 18 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2023-11-29 06:54:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2023-11-29 06:54:32,720 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 132 [2023-11-29 06:54:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:54:32,721 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2023-11-29 06:54:32,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 42 states have (on average 2.357142857142857) internal successors, (99), 44 states have internal predecessors, (99), 16 states have call successors, (30), 5 states have call predecessors, (30), 12 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) [2023-11-29 06:54:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2023-11-29 06:54:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 06:54:32,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:54:32,722 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:54:32,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:54:32,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:54:32,923 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:54:32,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:54:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1904732710, now seen corresponding path program 1 times [2023-11-29 06:54:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:54:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67080100] [2023-11-29 06:54:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:54:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:54:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:54:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:54:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:54:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:54:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:54:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:54:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:54:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:54:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:54:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:54:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:54:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:54:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:54:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:54:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:54:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:54:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 06:54:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-29 06:54:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:54:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67080100] [2023-11-29 06:54:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67080100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:54:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494429865] [2023-11-29 06:54:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:54:36,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:54:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:54:36,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:54:36,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 06:54:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:54:36,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 159 conjunts are in the unsatisfiable core [2023-11-29 06:54:36,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:54:37,172 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 06:54:42,246 INFO L349 Elim1Store]: treesize reduction 216, result has 26.3 percent of original size [2023-11-29 06:54:42,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 191 treesize of output 191 [2023-11-29 06:54:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-29 06:54:42,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:55:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494429865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:55:17,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:55:17,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35] total 56 [2023-11-29 06:55:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111178572] [2023-11-29 06:55:17,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:55:17,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 06:55:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:17,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 06:55:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4588, Unknown=6, NotChecked=0, Total=4830 [2023-11-29 06:55:17,738 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 56 states, 45 states have (on average 2.577777777777778) internal successors, (116), 44 states have internal predecessors, (116), 16 states have call successors, (39), 5 states have call predecessors, (39), 12 states have return successors, (38), 21 states have call predecessors, (38), 15 states have call successors, (38) [2023-11-29 06:55:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:30,012 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2023-11-29 06:55:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-29 06:55:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 45 states have (on average 2.577777777777778) internal successors, (116), 44 states have internal predecessors, (116), 16 states have call successors, (39), 5 states have call predecessors, (39), 12 states have return successors, (38), 21 states have call predecessors, (38), 15 states have call successors, (38) Word has length 145 [2023-11-29 06:55:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:30,015 INFO L225 Difference]: With dead ends: 223 [2023-11-29 06:55:30,015 INFO L226 Difference]: Without dead ends: 221 [2023-11-29 06:55:30,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 181 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3099 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=865, Invalid=14135, Unknown=6, NotChecked=0, Total=15006 [2023-11-29 06:55:30,020 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 184 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 116 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 3867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:30,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1103 Invalid, 3867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3734 Invalid, 17 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 06:55:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-29 06:55:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 177. [2023-11-29 06:55:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 115 states have (on average 1.0956521739130434) internal successors, (126), 119 states have internal predecessors, (126), 35 states have call successors, (35), 24 states have call predecessors, (35), 26 states have return successors, (40), 33 states have call predecessors, (40), 34 states have call successors, (40) [2023-11-29 06:55:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2023-11-29 06:55:30,060 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 145 [2023-11-29 06:55:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:30,060 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2023-11-29 06:55:30,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 45 states have (on average 2.577777777777778) internal successors, (116), 44 states have internal predecessors, (116), 16 states have call successors, (39), 5 states have call predecessors, (39), 12 states have return successors, (38), 21 states have call predecessors, (38), 15 states have call successors, (38) [2023-11-29 06:55:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2023-11-29 06:55:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 06:55:30,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:30,062 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:30,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 06:55:30,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:30,263 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:55:30,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash -615227224, now seen corresponding path program 1 times [2023-11-29 06:55:30,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:30,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337359649] [2023-11-29 06:55:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:30,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:55:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:55:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:55:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:55:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:55:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:55:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:55:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:55:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:55:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:55:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 06:55:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 06:55:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337359649] [2023-11-29 06:55:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337359649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:30,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:55:30,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562384237] [2023-11-29 06:55:30,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:30,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:55:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:55:30,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:55:30,831 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:55:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:31,393 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2023-11-29 06:55:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:55:31,394 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) Word has length 145 [2023-11-29 06:55:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:31,395 INFO L225 Difference]: With dead ends: 188 [2023-11-29 06:55:31,395 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 06:55:31,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:55:31,396 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 84 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:31,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 511 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:55:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 06:55:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-11-29 06:55:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 115 states have (on average 1.0869565217391304) internal successors, (125), 119 states have internal predecessors, (125), 35 states have call successors, (35), 24 states have call predecessors, (35), 26 states have return successors, (39), 33 states have call predecessors, (39), 34 states have call successors, (39) [2023-11-29 06:55:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 199 transitions. [2023-11-29 06:55:31,433 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 199 transitions. Word has length 145 [2023-11-29 06:55:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:31,434 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 199 transitions. [2023-11-29 06:55:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:55:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 199 transitions. [2023-11-29 06:55:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 06:55:31,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:31,435 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 06:55:31,435 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:55:31,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash 64831146, now seen corresponding path program 1 times [2023-11-29 06:55:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138165460] [2023-11-29 06:55:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:55:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:55:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:55:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:55:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:55:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:55:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:55:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:55:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:55:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:55:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 06:55:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 06:55:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138165460] [2023-11-29 06:55:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138165460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:55:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151834875] [2023-11-29 06:55:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:32,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:55:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:55:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:55:32,014 INFO L87 Difference]: Start difference. First operand 177 states and 199 transitions. Second operand has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 06:55:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:32,565 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2023-11-29 06:55:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:55:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 4 states have call successors, (21) Word has length 145 [2023-11-29 06:55:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:32,568 INFO L225 Difference]: With dead ends: 191 [2023-11-29 06:55:32,568 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 06:55:32,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-11-29 06:55:32,569 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:32,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 447 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:55:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 06:55:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2023-11-29 06:55:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 107 states have internal predecessors, (110), 35 states have call successors, (35), 22 states have call predecessors, (35), 23 states have return successors, (36), 33 states have call predecessors, (36), 34 states have call successors, (36) [2023-11-29 06:55:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2023-11-29 06:55:32,605 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 145 [2023-11-29 06:55:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:32,605 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2023-11-29 06:55:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 06:55:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2023-11-29 06:55:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 06:55:32,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:32,606 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:32,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 06:55:32,607 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:55:32,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 183894225, now seen corresponding path program 1 times [2023-11-29 06:55:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391419730] [2023-11-29 06:55:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:55:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:55:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:55:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:55:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:55:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:55:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:55:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:55:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:55:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 06:55:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 06:55:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-11-29 06:55:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391419730] [2023-11-29 06:55:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391419730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:55:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528705264] [2023-11-29 06:55:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:55:33,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:55:33,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 06:55:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:33,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 06:55:33,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:55:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 06:55:33,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:55:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528705264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:33,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:55:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 26 [2023-11-29 06:55:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079092620] [2023-11-29 06:55:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:33,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:55:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:33,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:55:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:55:33,689 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 13 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 06:55:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:33,895 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2023-11-29 06:55:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:55:33,896 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) Word has length 147 [2023-11-29 06:55:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:33,897 INFO L225 Difference]: With dead ends: 205 [2023-11-29 06:55:33,897 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 06:55:33,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2023-11-29 06:55:33,898 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 15 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:33,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 791 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:55:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 06:55:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-29 06:55:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 27 states have call successors, (27), 20 states have call predecessors, (27), 18 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 06:55:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2023-11-29 06:55:33,925 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 147 [2023-11-29 06:55:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:33,925 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2023-11-29 06:55:33,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 06:55:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2023-11-29 06:55:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 06:55:33,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:33,927 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:33,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 06:55:34,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:34,127 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:55:34,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1400147603, now seen corresponding path program 1 times [2023-11-29 06:55:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059129317] [2023-11-29 06:55:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:34,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:35,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:55:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:55:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:55:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:55:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:55:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:55:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:55:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:55:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 06:55:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:55:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 06:55:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 06:55:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-11-29 06:55:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059129317] [2023-11-29 06:55:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059129317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:55:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-29 06:55:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607885353] [2023-11-29 06:55:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 06:55:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 06:55:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:55:36,414 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 22 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 8 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-29 06:55:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:37,463 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2023-11-29 06:55:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 06:55:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 8 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) Word has length 151 [2023-11-29 06:55:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:37,464 INFO L225 Difference]: With dead ends: 147 [2023-11-29 06:55:37,464 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 06:55:37,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 06:55:37,465 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 91 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:37,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 568 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:55:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 06:55:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-11-29 06:55:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 27 states have call successors, (27), 20 states have call predecessors, (27), 18 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 06:55:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2023-11-29 06:55:37,498 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 151 [2023-11-29 06:55:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:37,498 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2023-11-29 06:55:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 8 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-29 06:55:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2023-11-29 06:55:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 06:55:37,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:55:37,500 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:37,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 06:55:37,500 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:55:37,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:55:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -998133440, now seen corresponding path program 1 times [2023-11-29 06:55:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:55:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712446265] [2023-11-29 06:55:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:55:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:55:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 06:55:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 06:55:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 06:55:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 06:55:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 06:55:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 06:55:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 06:55:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 06:55:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:55:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:55:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 06:55:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:55:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 06:55:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 06:55:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 06:55:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-11-29 06:55:40,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:55:40,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712446265] [2023-11-29 06:55:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712446265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:55:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75605841] [2023-11-29 06:55:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:55:40,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:55:40,249 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:55:40,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 06:55:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:55:40,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 06:55:40,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:55:40,662 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 06:55:41,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:55:41,359 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 22 [2023-11-29 06:55:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-11-29 06:55:41,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:55:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75605841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:55:41,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:55:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [27] total 41 [2023-11-29 06:55:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750550002] [2023-11-29 06:55:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:55:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 06:55:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:55:41,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 06:55:41,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 06:55:41,420 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 23 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 8 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 10 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-29 06:55:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:55:42,042 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2023-11-29 06:55:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:55:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 8 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 10 states have call predecessors, (20), 7 states have call successors, (20) Word has length 153 [2023-11-29 06:55:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:55:42,042 INFO L225 Difference]: With dead ends: 129 [2023-11-29 06:55:42,043 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:55:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 186 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=2371, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 06:55:42,044 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:55:42,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 968 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:55:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:55:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:55:42,045 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 06:55:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:55:42,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2023-11-29 06:55:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:55:42,045 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:55:42,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 8 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 10 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-29 06:55:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:55:42,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:55:42,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:55:42,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 06:55:42,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:55:42,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:55:55,364 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6883 6888) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-29 06:55:55,364 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6883 6888) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point L6884-1(lines 6884 6886) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L895 garLoopResultBuilder]: At program point L6884(lines 6884 6886) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point L6257-2(line 6257) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point L6257-3(line 6257) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point L6257(line 6257) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point L6257-5(line 6257) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6253 6258) the Hoare annotation is: true [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6253 6258) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-29 06:55:55,365 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-29 06:55:55,365 INFO L899 garLoopResultBuilder]: For program point L8005-4(lines 8005 8011) no Hoare annotation was computed. [2023-11-29 06:55:55,366 INFO L899 garLoopResultBuilder]: For program point L7994(lines 7991 8016) no Hoare annotation was computed. [2023-11-29 06:55:55,366 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_ignore_caseFINAL(lines 7986 8016) no Hoare annotation was computed. [2023-11-29 06:55:55,366 INFO L895 garLoopResultBuilder]: At program point L7992-1(line 7992) the Hoare annotation is: (or (and (= aws_array_eq_ignore_case_~len_b |aws_array_eq_ignore_case_#in~len_b|) (= aws_array_eq_ignore_case_~len_a |aws_array_eq_ignore_case_#in~len_a|)) (and (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse1 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19|))) (let ((.cse0 (mod (select .cse1 8) 18446744073709551616))) (or (< 9223372036854775807 .cse0) (not (= (mod (select .cse1 (+ 16 .cse0)) 256) 0)))))) (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse2 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19|))) (let ((.cse3 (mod (select .cse2 8) 18446744073709551616))) (or (not (= (mod (select .cse2 (+ .cse3 (- 18446744073709551600))) 256) 0)) (< .cse3 9223372036854775808))))))) [2023-11-29 06:55:55,367 INFO L895 garLoopResultBuilder]: At program point L7992(line 7992) the Hoare annotation is: (or (and (= aws_array_eq_ignore_case_~len_b |aws_array_eq_ignore_case_#in~len_b|) (= aws_array_eq_ignore_case_~len_a |aws_array_eq_ignore_case_#in~len_a|)) (and (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse1 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19|))) (let ((.cse0 (mod (select .cse1 8) 18446744073709551616))) (or (< 9223372036854775807 .cse0) (not (= (mod (select .cse1 (+ 16 .cse0)) 256) 0)))))) (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse2 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19|))) (let ((.cse3 (mod (select .cse2 8) 18446744073709551616))) (or (not (= (mod (select .cse2 (+ .cse3 (- 18446744073709551600))) 256) 0)) (< .cse3 9223372036854775808))))))) [2023-11-29 06:55:55,367 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7986 8016) the Hoare annotation is: true [2023-11-29 06:55:55,367 INFO L899 garLoopResultBuilder]: For program point L8006(lines 8006 8010) no Hoare annotation was computed. [2023-11-29 06:55:55,367 INFO L895 garLoopResultBuilder]: At program point L8005-3(lines 8005 8011) the Hoare annotation is: (or (and (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse1 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19|))) (let ((.cse0 (mod (select .cse1 8) 18446744073709551616))) (or (< 9223372036854775807 .cse0) (not (= (mod (select .cse1 (+ 16 .cse0)) 256) 0)))))) (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19| Int)) (let ((.cse2 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19|))) (let ((.cse3 (mod (select .cse2 8) 18446744073709551616))) (or (not (= (mod (select .cse2 (+ .cse3 (- 18446744073709551600))) 256) 0)) (< .cse3 9223372036854775808)))))) (and (= aws_array_eq_ignore_case_~len_b |aws_array_eq_ignore_case_#in~len_b|) (= aws_array_eq_ignore_case_~len_a |aws_array_eq_ignore_case_#in~len_a|) (= (mod |aws_array_eq_ignore_case_#in~len_a| 18446744073709551616) (mod |aws_array_eq_ignore_case_#in~len_b| 18446744073709551616)))) [2023-11-29 06:55:55,367 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_ignore_caseEXIT(lines 7986 8016) no Hoare annotation was computed. [2023-11-29 06:55:55,367 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6801 6805) no Hoare annotation was computed. [2023-11-29 06:55:55,368 INFO L899 garLoopResultBuilder]: For program point L6811-1(lines 6811 6812) no Hoare annotation was computed. [2023-11-29 06:55:55,368 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) 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 (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse1 (mod (select .cse2 8) 18446744073709551616))) (and (<= .cse1 9223372036854775807) (= (mod (select .cse2 (+ 16 .cse1)) 256) 0))))) (and (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select |old(#memory_int#3)| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse3 (mod (select .cse4 8) 18446744073709551616))) (or (< .cse3 9223372036854775808) (not (= (mod (select .cse4 (+ .cse3 (- 18446744073709551600))) 256) 0)))))) (forall ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select |old(#memory_int#3)| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse6 (mod (select .cse5 8) 18446744073709551616))) (or (not (= (mod (select .cse5 (+ .cse6 16)) 256) 0)) (< 9223372036854775807 .cse6)))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse8 (mod (select .cse7 8) 18446744073709551616))) (and (= (mod (select .cse7 (+ .cse8 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse8)))))) (or (< 0 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)) 1)) .cse0))) [2023-11-29 06:55:55,368 INFO L899 garLoopResultBuilder]: For program point L6811-5(lines 6811 6812) no Hoare annotation was computed. [2023-11-29 06:55:55,368 INFO L899 garLoopResultBuilder]: For program point L6808-1(line 6808) no Hoare annotation was computed. [2023-11-29 06:55:55,368 INFO L895 garLoopResultBuilder]: At program point L6808(line 6808) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |#memory_real#2| |old(#memory_real#2)|) (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|)) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (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#2| |old(#memory_int#2)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|) (or (< 0 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)) 1)) .cse0))) [2023-11-29 06:55:55,369 INFO L899 garLoopResultBuilder]: For program point L6811-3(line 6811) no Hoare annotation was computed. [2023-11-29 06:55:55,369 INFO L895 garLoopResultBuilder]: At program point L6811-2(line 6811) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (< 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 1)) .cse0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |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 06:55:55,369 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |#memory_real#2| |old(#memory_real#2)|) (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|)) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|)) [2023-11-29 06:55:55,369 INFO L899 garLoopResultBuilder]: For program point L6803-1(line 6803) no Hoare annotation was computed. [2023-11-29 06:55:55,369 INFO L895 garLoopResultBuilder]: At program point L6803(line 6803) the Hoare annotation is: (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |#memory_real#2| |old(#memory_real#2)|) (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|)) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|)) [2023-11-29 06:55:55,369 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2023-11-29 06:55:55,369 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6801 6805) the Hoare annotation is: (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |#memory_real#2| |old(#memory_real#2)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|)) [2023-11-29 06:55:55,370 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-29 06:55:55,370 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-29 06:55:55,370 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-29 06:55:55,370 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-29 06:55:55,370 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6890 6892) the Hoare annotation is: true [2023-11-29 06:55:55,370 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6890 6892) no Hoare annotation was computed. [2023-11-29 06:55:55,370 INFO L899 garLoopResultBuilder]: For program point L7455-1(line 7455) no Hoare annotation was computed. [2023-11-29 06:55:55,371 INFO L895 garLoopResultBuilder]: At program point L7455(line 7455) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (let ((.cse2 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base|))) (let ((.cse3 (select .cse2 8))) (and (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| 0) .cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.offset| 0) (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|) (= |ULTIMATE.start_aws_string_eq_ignore_case_#t~mem695#1| (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|) 8)) (let ((.cse1 (mod .cse3 18446744073709551616))) (or (and (<= 9223372036854775808 .cse1) (= (mod (select .cse2 (+ .cse1 (- 18446744073709551600))) 256) 0)) (and (= 0 (mod (select .cse2 (+ .cse1 16)) 256)) (<= .cse1 9223372036854775807)))) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (let ((.cse4 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|))) (let ((.cse5 (mod (select .cse4 8) 18446744073709551616))) (or (and (= (mod (select .cse4 (+ .cse5 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse5)) (and (= (mod (select .cse4 (+ .cse5 16)) 256) 0) (<= .cse5 9223372036854775807))))) (= |ULTIMATE.start_aws_string_eq_ignore_case_#t~mem696#1| .cse3) (or (= (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|) 16) 0) (< |ULTIMATE.start_aws_string_eq_ignore_case_#t~mem696#1| (+ 36028797018963951 (* (div (+ |ULTIMATE.start_aws_string_eq_ignore_case_#t~mem696#1| (- 1)) 18446744073709551616) 18446744073709551616)))) (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|)))))) [2023-11-29 06:55:55,371 INFO L895 garLoopResultBuilder]: At program point L8921(line 8921) the Hoare annotation is: (let ((.cse3 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|)) (.cse2 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|))) (let ((.cse1 (mod (select .cse2 8) 18446744073709551616)) (.cse0 (mod (select .cse3 8) 18446744073709551616))) (and (= .cse0 .cse1) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0) (or (and (= (mod (select .cse2 (+ 16 .cse1)) 256) 0) (<= .cse1 9223372036854775807)) (and (<= 9223372036854775808 .cse1) (= (mod (select .cse2 (+ (- 18446744073709551600) .cse1)) 256) 0))) (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (or (and (= (mod (select .cse3 (+ .cse0 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse0)) (and (= (mod (select .cse3 (+ .cse0 16)) 256) 0) (<= .cse0 9223372036854775807))) (= |ULTIMATE.start_aws_string_eq_ignore_case_#res#1| 1)))) [2023-11-29 06:55:55,371 INFO L895 garLoopResultBuilder]: At program point L8921-1(line 8921) the Hoare annotation is: (let ((.cse3 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|)) (.cse2 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|))) (let ((.cse1 (mod (select .cse2 8) 18446744073709551616)) (.cse0 (mod (select .cse3 8) 18446744073709551616))) (and (= .cse0 .cse1) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_#t~ret1315#1| 1) (or (and (= (mod (select .cse2 (+ 16 .cse1)) 256) 0) (<= .cse1 9223372036854775807)) (and (<= 9223372036854775808 .cse1) (= (mod (select .cse2 (+ (- 18446744073709551600) .cse1)) 256) 0))) (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (or (and (= (mod (select .cse3 (+ .cse0 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse0)) (and (= (mod (select .cse3 (+ .cse0 16)) 256) 0) (<= .cse0 9223372036854775807))) (= |ULTIMATE.start_aws_string_eq_ignore_case_#res#1| 1)))) [2023-11-29 06:55:55,371 INFO L899 garLoopResultBuilder]: For program point L8921-2(line 8921) no Hoare annotation was computed. [2023-11-29 06:55:55,371 INFO L899 garLoopResultBuilder]: For program point L7439(line 7439) no Hoare annotation was computed. [2023-11-29 06:55:55,372 INFO L899 garLoopResultBuilder]: For program point L7439-5(line 7439) no Hoare annotation was computed. [2023-11-29 06:55:55,372 INFO L895 garLoopResultBuilder]: At program point L7439-4(line 7439) the Hoare annotation is: (let ((.cse4 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|))) (let ((.cse7 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.offset| 0)) (.cse6 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse19 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse18 (mod (select .cse19 8) 18446744073709551616))) (and (<= .cse18 9223372036854775807) (= (mod (select .cse19 (+ 16 .cse18)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse20 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse21 (mod (select .cse20 8) 18446744073709551616))) (and (= (mod (select .cse20 (+ .cse21 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse21))))))) (.cse8 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|)) (.cse3 (select .cse4 8))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (and .cse1 (let ((.cse2 (div (+ 18446744073709551600 .cse3) 18446744073709551616))) (or (= (* .cse2 18446744073709551616) .cse3) (and (= (select .cse4 (+ 16 (* .cse2 (- 18446744073709551616)) .cse3)) 0) (<= 0 (+ .cse3 (* 18446744073709551616 (div (+ 15 (* (- 1) .cse3)) 18446744073709551616))))))) .cse0 .cse5 .cse6 (or (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|) .cse7) .cse8 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) .cse9) (let ((.cse17 (mod .cse3 18446744073709551616))) (let ((.cse13 (= (mod (select .cse4 (+ .cse17 (- 18446744073709551600))) 256) 0)) (.cse14 (<= 9223372036854775808 .cse17)) (.cse15 (<= .cse17 9223372036854775807)) (.cse16 (= (mod (select .cse4 (+ 16 .cse17)) 256) 0))) (let ((.cse10 (or (and .cse13 .cse14) (and .cse15 .cse16))) (.cse11 (or (and (not .cse13) .cse14) (and .cse15 (not .cse16))))) (and (not .cse7) .cse1 (or (and |ULTIMATE.start_aws_string_eq_ignore_case_#t~short692#1| .cse10) (and .cse11 (not |ULTIMATE.start_aws_string_eq_ignore_case_#t~short692#1|))) .cse0 .cse5 .cse6 (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_#t~ret691#1| 1) .cse10) (and .cse11 (= |ULTIMATE.start_aws_string_eq_ignore_case_#t~ret691#1| 0))) .cse8 (or (= (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|) 16) 0) (let ((.cse12 (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base|) 8))) (< .cse12 (+ 36028797018963951 (* 18446744073709551616 (div (+ (- 1) .cse12) 18446744073709551616)))))) .cse9))))))) [2023-11-29 06:55:55,372 INFO L899 garLoopResultBuilder]: For program point L7439-3(line 7439) no Hoare annotation was computed. [2023-11-29 06:55:55,373 INFO L895 garLoopResultBuilder]: At program point L7439-2(line 7439) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| 0)) (.cse3 (not |ULTIMATE.start_aws_string_eq_ignore_case_#t~short692#1|)) (.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.offset| 0)) (.cse5 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse13 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse12 (mod (select .cse13 8) 18446744073709551616))) (and (<= .cse12 9223372036854775807) (= (mod (select .cse13 (+ 16 .cse12)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse14 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse15 (mod (select .cse14 8) 18446744073709551616))) (and (= (mod (select .cse14 (+ .cse15 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse15))))))) (.cse1 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|)) (.cse8 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (and (not .cse1) .cse2 .cse3 .cse0 .cse4 .cse5 (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) .cse6 (or (= (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|) 16) 0) (let ((.cse7 (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base|) 8))) (< .cse7 (+ 36028797018963951 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)))))) .cse8) (and .cse2 .cse3 (let ((.cse11 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|))) (let ((.cse10 (select .cse11 8))) (let ((.cse9 (div (+ 18446744073709551600 .cse10) 18446744073709551616))) (or (= (* .cse9 18446744073709551616) .cse10) (and (= (select .cse11 (+ 16 (* .cse9 (- 18446744073709551616)) .cse10)) 0) (<= 0 (+ .cse10 (* 18446744073709551616 (div (+ 15 (* (- 1) .cse10)) 18446744073709551616))))))))) .cse0 .cse4 .cse5 (or (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|) .cse1) .cse6 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) .cse8))) [2023-11-29 06:55:55,373 INFO L895 garLoopResultBuilder]: At program point L8922(line 8922) the Hoare annotation is: (let ((.cse1 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|))) (let ((.cse0 (mod (select .cse1 8) 18446744073709551616))) (and (= .cse0 (mod (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|) 8) 18446744073709551616)) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0) (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (or (and (= (mod (select .cse1 (+ .cse0 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse0)) (and (= (mod (select .cse1 (+ .cse0 16)) 256) 0) (<= .cse0 9223372036854775807))) (= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_string_eq_ignore_case_harness_#t~mem1316#1| 18446744073709551616)) |ULTIMATE.start_aws_string_eq_ignore_case_harness_#t~mem1317#1|) (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_string_eq_ignore_case_harness_#t~mem1317#1| 18446744073709551616)) |ULTIMATE.start_aws_string_eq_ignore_case_harness_#t~mem1316#1|)) (= |ULTIMATE.start_aws_string_eq_ignore_case_#res#1| 1)))) [2023-11-29 06:55:55,373 INFO L899 garLoopResultBuilder]: For program point L8918-1(line 8918) no Hoare annotation was computed. [2023-11-29 06:55:55,373 INFO L899 garLoopResultBuilder]: For program point L8922-1(line 8922) no Hoare annotation was computed. [2023-11-29 06:55:55,373 INFO L895 garLoopResultBuilder]: At program point L8918(line 8918) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (and (let ((.cse1 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|))) (let ((.cse2 (select .cse1 8))) (or (let ((.cse3 (div (+ 18446744073709551600 .cse2) 18446744073709551616))) (and (= (select .cse1 (+ 16 .cse2 (* (- 18446744073709551616) .cse3))) 0) (= (div .cse2 18446744073709551616) .cse3))) (< (+ (* (div (+ 18446744073709551615 (* (- 1) .cse2)) 18446744073709551616) 18446744073709551616) .cse2) 1)))) .cse0 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse4 (mod (select .cse5 8) 18446744073709551616))) (and (<= .cse4 9223372036854775807) (= (mod (select .cse5 (+ 16 .cse4)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse7 (mod (select .cse6 8) 18446744073709551616))) (and (= (mod (select .cse6 (+ .cse7 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse7))))))))) [2023-11-29 06:55:55,373 INFO L895 garLoopResultBuilder]: At program point L7440-2(line 7440) the Hoare annotation is: (let ((.cse5 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|))) (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|)) (.cse7 (select .cse5 8)) (.cse4 (not |ULTIMATE.start_aws_string_eq_ignore_case_#t~short694#1|)) (.cse9 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (and .cse1 .cse0 .cse2 (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) .cse3 .cse4 (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (let ((.cse6 (mod .cse7 18446744073709551616))) (or (and (= (mod (select .cse5 (+ .cse6 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse6)) (and (<= .cse6 9223372036854775807) (= (mod (select .cse5 (+ 16 .cse6)) 256) 0)))) (or (= (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|) 16) 0) (let ((.cse8 (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base|) 8))) (< .cse8 (+ 36028797018963951 (* 18446744073709551616 (div (+ (- 1) .cse8) 18446744073709551616)))))) .cse9) (and .cse1 .cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|) .cse2 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse11 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse10 (mod (select .cse11 8) 18446744073709551616))) (and (<= .cse10 9223372036854775807) (= (mod (select .cse11 (+ 16 .cse10)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse12 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse13 (mod (select .cse12 8) 18446744073709551616))) (and (= (mod (select .cse12 (+ .cse13 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse13)))))) .cse3 (= (* (div (+ 18446744073709551600 .cse7) 18446744073709551616) 18446744073709551616) .cse7) .cse4 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) .cse9)))) [2023-11-29 06:55:55,373 INFO L899 garLoopResultBuilder]: For program point L7440(line 7440) no Hoare annotation was computed. [2023-11-29 06:55:55,374 INFO L899 garLoopResultBuilder]: For program point L7440-5(line 7440) no Hoare annotation was computed. [2023-11-29 06:55:55,374 INFO L895 garLoopResultBuilder]: At program point L7440-4(line 7440) the Hoare annotation is: (let ((.cse3 (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_string_eq_ignore_case_#t~ret693#1| 0)) (.cse14 (= |ULTIMATE.start_aws_string_eq_ignore_case_#t~ret693#1| 1)) (.cse1 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| 0)) (.cse6 (not |ULTIMATE.start_aws_string_eq_ignore_case_#t~short694#1|)) (.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|)) (.cse17 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|)) (.cse19 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base|))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (let ((.cse16 (select .cse19 8))) (let ((.cse18 (mod .cse16 18446744073709551616))) (let ((.cse10 (= 0 (mod (select .cse19 (+ .cse18 16)) 256))) (.cse7 (= (mod (select .cse19 (+ .cse18 (- 18446744073709551600))) 256) 0))) (let ((.cse5 (not .cse7)) (.cse8 (<= 9223372036854775808 .cse18)) (.cse11 (<= .cse18 9223372036854775807)) (.cse9 (not .cse10))) (and .cse1 .cse0 .cse2 .cse3 .cse4 (or (and (or (and .cse5 .cse6) (and |ULTIMATE.start_aws_string_eq_ignore_case_#t~short694#1| .cse7)) .cse8) (and (or (and .cse9 .cse6) (and .cse10 |ULTIMATE.start_aws_string_eq_ignore_case_#t~short694#1|)) .cse11)) (let ((.cse12 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|))) (let ((.cse13 (mod (select .cse12 8) 18446744073709551616))) (or (and (= (mod (select .cse12 (+ .cse13 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse13)) (and (<= .cse13 9223372036854775807) (= (mod (select .cse12 (+ 16 .cse13)) 256) 0))))) (or (and (or (and .cse14 .cse7) (and .cse5 .cse15)) .cse8) (and .cse11 (or (and .cse15 .cse9) (and .cse10 .cse14)))) (or (= (select (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|) 16) 0) (< .cse16 (+ 36028797018963951 (* 18446744073709551616 (div (+ (- 1) .cse16) 18446744073709551616))))) .cse17))))) (and .cse1 .cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| 0)) (let ((.cse30 (mod (select .cse19 (+ |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| 8)) 18446744073709551616))) (let ((.cse27 (<= 9223372036854775808 .cse30)) (.cse26 (= 0 (mod (select .cse19 (+ |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| .cse30 (- 18446744073709551600))) 256))) (.cse28 (= (mod (select .cse19 (+ |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| .cse30 16)) 256) 0)) (.cse29 (<= .cse30 9223372036854775807))) (let ((.cse20 (or (and .cse27 (not .cse26)) (and (not .cse28) .cse29))) (.cse21 (or (and .cse26 .cse27) (and .cse28 .cse29)))) (and (or (and .cse15 .cse20) (and .cse21 .cse14)) .cse1 (or (and .cse6 .cse20) (and .cse21 |ULTIMATE.start_aws_string_eq_ignore_case_#t~short694#1|)) .cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.base| |ULTIMATE.start_aws_string_eq_ignore_case_~a#1.base|) .cse2 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse23 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse22 (mod (select .cse23 8) 18446744073709551616))) (and (<= .cse22 9223372036854775807) (= (mod (select .cse23 (+ 16 .cse22)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse24 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse25 (mod (select .cse24 8) 18446744073709551616))) (and (= (mod (select .cse24 (+ .cse25 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse25)))))) .cse4 (= |ULTIMATE.start_aws_string_eq_ignore_case_~b#1.offset| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) .cse17)))))) [2023-11-29 06:55:55,374 INFO L899 garLoopResultBuilder]: For program point L7440-3(line 7440) no Hoare annotation was computed. [2023-11-29 06:55:55,374 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:55:55,374 INFO L899 garLoopResultBuilder]: For program point L8919(lines 8919 8923) no Hoare annotation was computed. [2023-11-29 06:55:55,375 INFO L899 garLoopResultBuilder]: For program point L7441(lines 7441 7445) no Hoare annotation was computed. [2023-11-29 06:55:55,375 INFO L899 garLoopResultBuilder]: For program point L8911(lines 8911 8924) no Hoare annotation was computed. [2023-11-29 06:55:55,375 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:55:55,375 INFO L899 garLoopResultBuilder]: For program point L7446(lines 7446 7454) no Hoare annotation was computed. [2023-11-29 06:55:55,375 INFO L895 garLoopResultBuilder]: At program point L8916(line 8916) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (and (let ((.cse1 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|))) (let ((.cse2 (select .cse1 8))) (or (let ((.cse3 (div (+ 18446744073709551600 .cse2) 18446744073709551616))) (and (= (select .cse1 (+ 16 .cse2 (* (- 18446744073709551616) .cse3))) 0) (= (div .cse2 18446744073709551616) .cse3))) (< (+ (* (div (+ 18446744073709551615 (* (- 1) .cse2)) 18446744073709551616) 18446744073709551616) .cse2) 1)))) .cse0 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse4 (mod (select .cse5 8) 18446744073709551616))) (and (<= .cse4 9223372036854775807) (= (mod (select .cse5 (+ 16 .cse4)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse7 (mod (select .cse6 8) 18446744073709551616))) (and (= (mod (select .cse6 (+ .cse7 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse7))))))))) [2023-11-29 06:55:55,375 INFO L899 garLoopResultBuilder]: For program point L8916-1(lines 8916 8918) no Hoare annotation was computed. [2023-11-29 06:55:55,375 INFO L895 garLoopResultBuilder]: At program point L8916-2(line 8916) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0) .cse0) (and (let ((.cse1 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|))) (let ((.cse2 (select .cse1 8))) (or (let ((.cse3 (div (+ 18446744073709551600 .cse2) 18446744073709551616))) (and (= (select .cse1 (+ 16 .cse2 (* (- 18446744073709551616) .cse3))) 0) (= (div .cse2 18446744073709551616) .cse3))) (< (+ (* (div (+ 18446744073709551615 (* (- 1) .cse2)) 18446744073709551616) 18446744073709551616) .cse2) 1)))) .cse0 (or (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse4 (mod (select .cse5 8) 18446744073709551616))) (and (<= .cse4 9223372036854775807) (= (mod (select .cse5 (+ 16 .cse4)) 256) 0))))) (exists ((|v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select |#memory_int#3| |v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_7|))) (let ((.cse7 (mod (select .cse6 8) 18446744073709551616))) (and (= (mod (select .cse6 (+ .cse7 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse7))))))))) [2023-11-29 06:55:55,376 INFO L895 garLoopResultBuilder]: At program point L8920(line 8920) the Hoare annotation is: (let ((.cse3 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|)) (.cse2 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|))) (let ((.cse1 (mod (select .cse2 8) 18446744073709551616)) (.cse0 (mod (select .cse3 8) 18446744073709551616))) (and (= .cse0 .cse1) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0) (or (and (= (mod (select .cse2 (+ 16 .cse1)) 256) 0) (<= .cse1 9223372036854775807)) (and (<= 9223372036854775808 .cse1) (= (mod (select .cse2 (+ (- 18446744073709551600) .cse1)) 256) 0))) (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (or (and (= (mod (select .cse3 (+ .cse0 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse0)) (and (= (mod (select .cse3 (+ .cse0 16)) 256) 0) (<= .cse0 9223372036854775807))) (= |ULTIMATE.start_aws_string_eq_ignore_case_#res#1| 1)))) [2023-11-29 06:55:55,376 INFO L895 garLoopResultBuilder]: At program point L8920-1(line 8920) the Hoare annotation is: (let ((.cse3 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base|)) (.cse2 (select |#memory_int#3| |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base|))) (let ((.cse1 (mod (select .cse2 8) 18446744073709551616)) (.cse0 (mod (select .cse3 8) 18446744073709551616))) (and (= .cse0 .cse1) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_a~1#1.offset| 0) (or (and (= (mod (select .cse2 (+ 16 .cse1)) 256) 0) (<= .cse1 9223372036854775807)) (and (<= 9223372036854775808 .cse1) (= (mod (select .cse2 (+ (- 18446744073709551600) .cse1)) 256) 0))) (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_#t~ret1314#1| 1) (= 0 |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.offset|) (not (= |ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base| 0)) (or (and (= (mod (select .cse3 (+ .cse0 (- 18446744073709551600))) 256) 0) (<= 9223372036854775808 .cse0)) (and (= (mod (select .cse3 (+ .cse0 16)) 256) 0) (<= .cse0 9223372036854775807))) (= |ULTIMATE.start_aws_string_eq_ignore_case_#res#1| 1)))) [2023-11-29 06:55:55,376 INFO L899 garLoopResultBuilder]: For program point L8920-2(line 8920) no Hoare annotation was computed. [2023-11-29 06:55:55,376 INFO L899 garLoopResultBuilder]: For program point L8912-3(line 8912) no Hoare annotation was computed. [2023-11-29 06:55:55,376 INFO L899 garLoopResultBuilder]: For program point L8912-5(lines 8912 8913) no Hoare annotation was computed. [2023-11-29 06:55:55,376 INFO L899 garLoopResultBuilder]: For program point L8916-3(line 8916) no Hoare annotation was computed. [2023-11-29 06:55:55,376 INFO L902 garLoopResultBuilder]: At program point L8912(line 8912) the Hoare annotation is: true [2023-11-29 06:55:55,376 INFO L899 garLoopResultBuilder]: For program point L8912-1(lines 8912 8913) no Hoare annotation was computed. [2023-11-29 06:55:55,376 INFO L899 garLoopResultBuilder]: For program point L8916-5(lines 8916 8918) no Hoare annotation was computed. [2023-11-29 06:55:55,376 INFO L902 garLoopResultBuilder]: At program point L8912-2(line 8912) the Hoare annotation is: true [2023-11-29 06:55:55,377 INFO L899 garLoopResultBuilder]: For program point aws_string_eq_ignore_case_returnLabel#1(lines 7437 7456) no Hoare annotation was computed. [2023-11-29 06:55:55,377 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-29 06:55:55,377 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-29 06:55:55,377 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-29 06:55:55,377 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-29 06:55:55,377 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-29 06:55:55,377 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-29 06:55:55,379 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:55:55,381 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:55:55,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19 : int :: 9223372036854775807 < #memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616 || !(#memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][16 + #memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616] % 256 == 0)) could not be translated [2023-11-29 06:55:55,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19 : int :: !(#memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][#memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616 + -18446744073709551600] % 256 == 0) || #memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616 < 9223372036854775808) could not be translated [2023-11-29 06:55:55,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:55:55 BoogieIcfgContainer [2023-11-29 06:55:55,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:55:55,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:55:55,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:55:55,391 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:55:55,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:52:16" (3/4) ... [2023-11-29 06:55:55,393 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:55:55,395 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_ignore_case [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2023-11-29 06:55:55,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2023-11-29 06:55:55,406 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2023-11-29 06:55:55,407 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 06:55:55,408 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:55:55,409 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:55:55,681 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:55:55,681 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:55:55,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:55:55,682 INFO L158 Benchmark]: Toolchain (without parser) took 223061.48ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 118.7MB in the beginning and 1.1GB in the end (delta: -962.3MB). Peak memory consumption was 268.4MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,682 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 117.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:55:55,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2829.30ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 118.0MB in the beginning and 175.1MB in the end (delta: -57.1MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.93ms. Allocated memory is still 234.9MB. Free memory was 175.1MB in the beginning and 166.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,683 INFO L158 Benchmark]: Boogie Preprocessor took 96.26ms. Allocated memory is still 234.9MB. Free memory was 166.7MB in the beginning and 159.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,683 INFO L158 Benchmark]: RCFGBuilder took 744.50ms. Allocated memory is still 234.9MB. Free memory was 159.4MB in the beginning and 108.0MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,684 INFO L158 Benchmark]: TraceAbstraction took 218950.89ms. Allocated memory was 234.9MB in the beginning and 1.2GB in the end (delta: 939.5MB). Free memory was 106.9MB in the beginning and 856.3MB in the end (delta: -749.4MB). Peak memory consumption was 649.9MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,684 INFO L158 Benchmark]: Witness Printer took 290.71ms. Allocated memory is still 1.2GB. Free memory was 856.3MB in the beginning and 1.1GB in the end (delta: -224.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2023-11-29 06:55:55,686 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.21ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 117.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2829.30ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 118.0MB in the beginning and 175.1MB in the end (delta: -57.1MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.93ms. Allocated memory is still 234.9MB. Free memory was 175.1MB in the beginning and 166.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.26ms. Allocated memory is still 234.9MB. Free memory was 166.7MB in the beginning and 159.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 744.50ms. Allocated memory is still 234.9MB. Free memory was 159.4MB in the beginning and 108.0MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 218950.89ms. Allocated memory was 234.9MB in the beginning and 1.2GB in the end (delta: 939.5MB). Free memory was 106.9MB in the beginning and 856.3MB in the end (delta: -749.4MB). Peak memory consumption was 649.9MB. Max. memory is 16.1GB. * Witness Printer took 290.71ms. Allocated memory is still 1.2GB. Free memory was 856.3MB in the beginning and 1.1GB in the end (delta: -224.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8588]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8588] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19 : int :: 9223372036854775807 < #memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616 || !(#memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][16 + #memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616] % 256 == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19 : int :: !(#memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][#memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616 + -18446744073709551600] % 256 == 0) || #memory_int#3[v_ULTIMATE.start_aws_string_eq_ignore_case_harness_~str_b~1#1.base_BEFORE_CALL_19][8] % 18446744073709551616 < 9223372036854775808) could not be translated * 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 10 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 218.9s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 51.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 2065 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1841 mSDsluCounter, 16575 SdHoareTripleChecker+Invalid, 22.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14976 mSDsCounter, 1062 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23879 IncrementalHoareTripleChecker+Invalid, 24965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1062 mSolverCounterUnsat, 1599 mSDtfsCounter, 23879 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2814 GetRequests, 1966 SyntacticMatches, 18 SemanticMatches, 830 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11173 ImplicationChecksByTransitivity, 110.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=20, InterpolantAutomatonStates: 490, 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, 25 MinimizatonAttempts, 193 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 277 PreInvPairs, 333 NumberOfFragments, 3563 HoareAnnotationTreeSize, 277 FomulaSimplifications, 22729 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 36872 FormulaSimplificationTreeSizeReductionInter, 12.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 146.0s InterpolantComputationTime, 3656 NumberOfCodeBlocks, 3656 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3834 ConstructedInterpolants, 97 QuantifiedInterpolants, 31912 SizeOfPredicates, 217 NumberOfNonLiveVariables, 9160 ConjunctsInSsa, 754 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 3391/3528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8005]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 06:55:55,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3583ef7b-6520-4ae3-90da-c62f9a7ccc56/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