./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_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_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/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_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/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_bb743124-b08b-4637-8b11-c187c46bf964/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 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:36:26,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:36:26,790 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-28 20:36:26,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:36:26,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:36:26,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:36:26,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:36:26,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:36:26,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:36:26,826 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:36:26,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:36:26,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:36:26,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:36:26,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:36:26,829 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:36:26,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:36:26,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:36:26,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:36:26,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:36:26,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:36:26,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:36:26,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:36:26,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:36:26,833 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:36:26,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:36:26,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:36:26,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:36:26,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:36:26,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:26,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:36:26,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:36:26,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:36:26,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:36:26,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:36:26,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:36:26,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:36:26,838 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:36:26,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:36:26,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:36:26,839 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_bb743124-b08b-4637-8b11-c187c46bf964/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_bb743124-b08b-4637-8b11-c187c46bf964/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 -> 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa [2023-11-28 20:36:27,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:36:27,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:36:27,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:36:27,090 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:36:27,093 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:36:27,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2023-11-28 20:36:29,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:30,244 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:30,245 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2023-11-28 20:36:30,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/data/42ba91ad5/f9777cef4ddc4fe29154dd87c99ec410/FLAG7e305f2bd [2023-11-28 20:36:30,293 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/data/42ba91ad5/f9777cef4ddc4fe29154dd87c99ec410 [2023-11-28 20:36:30,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:30,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:30,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:30,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:30,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:30,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:30" (1/1) ... [2023-11-28 20:36:30,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399dc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:30, skipping insertion in model container [2023-11-28 20:36:30,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:30" (1/1) ... [2023-11-28 20:36:30,438 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:30,657 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_bb743124-b08b-4637-8b11-c187c46bf964/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2023-11-28 20:36:30,663 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_bb743124-b08b-4637-8b11-c187c46bf964/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2023-11-28 20:36:31,492 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,493 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,494 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,495 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,496 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,511 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,512 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,514 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,515 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:31,912 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-28 20:36:31,913 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-28 20:36:31,914 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-28 20:36:31,916 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-28 20:36:31,918 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-28 20:36:31,919 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-28 20:36:31,919 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-28 20:36:31,920 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-28 20:36:31,921 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-28 20:36:31,922 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-28 20:36:32,174 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,175 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:32,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:36:32,337 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_bb743124-b08b-4637-8b11-c187c46bf964/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2023-11-28 20:36:32,338 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_bb743124-b08b-4637-8b11-c187c46bf964/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2023-11-28 20:36:32,373 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,374 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,374 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,375 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,376 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,382 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,383 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,384 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,416 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-28 20:36:32,417 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-28 20:36:32,418 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-28 20:36:32,418 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-28 20:36:32,419 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-28 20:36:32,420 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-28 20:36:32,420 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-28 20:36:32,421 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-28 20:36:32,421 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-28 20:36:32,422 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-28 20:36:32,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-28 20:36:32,499 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,500 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-28 20:36:32,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-28 20:36:32,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:32,791 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,791 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,791 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,792 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,792 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,792 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,792 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,792 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,792 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,793 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,793 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,793 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,793 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,793 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,793 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,794 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,794 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,794 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:32,802 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:36:32,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32 WrapperNode [2023-11-28 20:36:32,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:32,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:32,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:36:32,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:36:32,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,967 INFO L138 Inliner]: procedures = 689, calls = 2740, calls flagged for inlining = 58, calls inlined = 6, statements flattened = 792 [2023-11-28 20:36:32,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:32,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:36:32,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:36:32,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:36:32,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:32,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,092 INFO L175 MemorySlicer]: Split 517 memory accesses to 7 slices as follows [2, 256, 236, 13, 5, 2, 3]. 50 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 256, 236, 0, 5, 0, 3]. The 5 writes are split as follows [0, 0, 0, 4, 0, 1, 0]. [2023-11-28 20:36:33,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:36:33,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:36:33,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:36:33,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:36:33,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (1/1) ... [2023-11-28 20:36:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:33,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:36:33,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:36:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-28 20:36:33,249 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-28 20:36:33,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:36:33,250 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-28 20:36:33,250 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-28 20:36:33,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#0 [2023-11-28 20:36:33,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#1 [2023-11-28 20:36:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#2 [2023-11-28 20:36:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#3 [2023-11-28 20:36:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#4 [2023-11-28 20:36:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#5 [2023-11-28 20:36:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#6 [2023-11-28 20:36:33,251 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-28 20:36:33,252 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-28 20:36:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-28 20:36:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-28 20:36:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-28 20:36:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-28 20:36:33,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-28 20:36:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-28 20:36:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-28 20:36:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:36:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:36:33,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 20:36:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-28 20:36:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-28 20:36:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-28 20:36:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-28 20:36:33,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-28 20:36:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-28 20:36:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-28 20:36:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-28 20:36:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-28 20:36:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-28 20:36:33,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-28 20:36:33,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-28 20:36:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-28 20:36:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-28 20:36:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-28 20:36:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-28 20:36:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-28 20:36:33,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-28 20:36:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-28 20:36:33,258 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-28 20:36:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-28 20:36:33,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-28 20:36:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 20:36:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:36:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 20:36:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:36:33,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:36:33,259 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-28 20:36:33,260 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-28 20:36:33,260 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2023-11-28 20:36:33,260 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2023-11-28 20:36:33,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-28 20:36:33,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-28 20:36:33,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-28 20:36:33,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-28 20:36:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-28 20:36:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-28 20:36:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-28 20:36:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-28 20:36:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-28 20:36:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-28 20:36:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-28 20:36:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-28 20:36:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-28 20:36:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-28 20:36:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-28 20:36:33,262 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-28 20:36:33,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:36:33,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:36:33,263 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-28 20:36:33,263 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-28 20:36:33,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:36:33,263 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-28 20:36:33,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-28 20:36:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-28 20:36:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-28 20:36:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-28 20:36:33,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-28 20:36:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-28 20:36:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-28 20:36:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-28 20:36:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2023-11-28 20:36:33,265 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2023-11-28 20:36:33,265 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-28 20:36:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-28 20:36:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-28 20:36:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-28 20:36:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-28 20:36:33,266 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-28 20:36:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:36:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#0 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#1 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#2 [2023-11-28 20:36:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#3 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#4 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#5 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#6 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:36:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 20:36:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-28 20:36:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-28 20:36:33,596 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:36:33,599 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:36:34,449 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2023-11-28 20:36:35,169 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:36:35,311 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:36:35,311 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-28 20:36:35,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:35 BoogieIcfgContainer [2023-11-28 20:36:35,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:36:35,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:36:35,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:36:35,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:36:35,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:36:30" (1/3) ... [2023-11-28 20:36:35,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b80fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:35, skipping insertion in model container [2023-11-28 20:36:35,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:32" (2/3) ... [2023-11-28 20:36:35,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b80fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:35, skipping insertion in model container [2023-11-28 20:36:35,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:35" (3/3) ... [2023-11-28 20:36:35,320 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_array_harness.i [2023-11-28 20:36:35,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:36:35,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:36:35,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:36:35,400 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;@307c8f8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:36:35,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:36:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:36:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-28 20:36:35,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:35,417 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-28 20:36:35,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:35,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1531959549, now seen corresponding path program 1 times [2023-11-28 20:36:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:35,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213941266] [2023-11-28 20:36:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:35,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-28 20:36:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 20:36:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:36:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:36,204 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-28 20:36:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213941266] [2023-11-28 20:36:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213941266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:36,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:36,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:36:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855254345] [2023-11-28 20:36:36,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:36,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:36:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:36:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:36,248 INFO L87 Difference]: Start difference. First operand has 115 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-28 20:36:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:36,997 INFO L93 Difference]: Finished difference Result 239 states and 320 transitions. [2023-11-28 20:36:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:36:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 64 [2023-11-28 20:36:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:37,011 INFO L225 Difference]: With dead ends: 239 [2023-11-28 20:36:37,011 INFO L226 Difference]: Without dead ends: 125 [2023-11-28 20:36:37,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:37,020 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:37,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 128 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:36:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-28 20:36:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2023-11-28 20:36:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-28 20:36:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2023-11-28 20:36:37,089 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 64 [2023-11-28 20:36:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:37,089 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2023-11-28 20:36:37,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-28 20:36:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2023-11-28 20:36:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-28 20:36:37,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:37,094 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-28 20:36:37,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:36:37,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:37,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -854023103, now seen corresponding path program 1 times [2023-11-28 20:36:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:37,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901344028] [2023-11-28 20:36:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-28 20:36:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 20:36:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:36:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,941 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-28 20:36:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:37,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901344028] [2023-11-28 20:36:37,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901344028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:37,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:37,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:36:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962834288] [2023-11-28 20:36:37,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:37,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:36:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:37,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:36:37,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:37,946 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-28 20:36:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:38,932 INFO L93 Difference]: Finished difference Result 166 states and 203 transitions. [2023-11-28 20:36:38,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:36:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 64 [2023-11-28 20:36:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:38,936 INFO L225 Difference]: With dead ends: 166 [2023-11-28 20:36:38,936 INFO L226 Difference]: Without dead ends: 129 [2023-11-28 20:36:38,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:38,938 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:38,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 272 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:36:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-28 20:36:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2023-11-28 20:36:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-28 20:36:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2023-11-28 20:36:38,961 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 64 [2023-11-28 20:36:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:38,962 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2023-11-28 20:36:38,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-28 20:36:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2023-11-28 20:36:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-28 20:36:38,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:38,965 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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-28 20:36:38,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:36:38,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:38,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash 767856172, now seen corresponding path program 1 times [2023-11-28 20:36:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788823337] [2023-11-28 20:36:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-28 20:36:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 20:36:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:36:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:39,864 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-28 20:36:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788823337] [2023-11-28 20:36:39,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788823337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:39,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:39,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:36:39,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111665541] [2023-11-28 20:36:39,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:39,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:36:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:36:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:39,867 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-28 20:36:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:40,813 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2023-11-28 20:36:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:36:40,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 68 [2023-11-28 20:36:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:40,817 INFO L225 Difference]: With dead ends: 180 [2023-11-28 20:36:40,817 INFO L226 Difference]: Without dead ends: 141 [2023-11-28 20:36:40,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:40,819 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:40,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 291 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:36:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-28 20:36:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2023-11-28 20:36:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-28 20:36:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2023-11-28 20:36:40,841 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 68 [2023-11-28 20:36:40,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:40,842 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2023-11-28 20:36:40,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-28 20:36:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2023-11-28 20:36:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-28 20:36:40,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:40,845 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:40,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:36:40,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:40,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1214823882, now seen corresponding path program 1 times [2023-11-28 20:36:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292376301] [2023-11-28 20:36:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:36:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:36:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:36:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:36:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:36:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-28 20:36:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-28 20:36:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292376301] [2023-11-28 20:36:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292376301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:41,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:36:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530779603] [2023-11-28 20:36:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:41,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:41,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:41,850 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-28 20:36:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:42,961 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2023-11-28 20:36:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:36:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 107 [2023-11-28 20:36:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:42,964 INFO L225 Difference]: With dead ends: 175 [2023-11-28 20:36:42,964 INFO L226 Difference]: Without dead ends: 125 [2023-11-28 20:36:42,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:36:42,966 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 146 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:42,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 269 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:36:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-28 20:36:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2023-11-28 20:36:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-28 20:36:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2023-11-28 20:36:42,979 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 107 [2023-11-28 20:36:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:42,979 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2023-11-28 20:36:42,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-28 20:36:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2023-11-28 20:36:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-28 20:36:42,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:42,981 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:42,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:36:42,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:42,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1340361338, now seen corresponding path program 1 times [2023-11-28 20:36:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900640008] [2023-11-28 20:36:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:36:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:36:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:36:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:36:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:36:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:36:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-28 20:36:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900640008] [2023-11-28 20:36:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900640008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:43,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:43,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:36:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332000162] [2023-11-28 20:36:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:36:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:36:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:36:43,846 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-28 20:36:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:44,974 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2023-11-28 20:36:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:36:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 111 [2023-11-28 20:36:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:44,976 INFO L225 Difference]: With dead ends: 187 [2023-11-28 20:36:44,977 INFO L226 Difference]: Without dead ends: 127 [2023-11-28 20:36:44,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:36:44,978 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 167 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:44,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 311 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:36:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-28 20:36:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2023-11-28 20:36:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 62 states have internal predecessors, (68), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-28 20:36:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2023-11-28 20:36:44,993 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 111 [2023-11-28 20:36:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:44,994 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2023-11-28 20:36:44,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-28 20:36:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2023-11-28 20:36:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-28 20:36:44,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:44,997 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:44,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:36:44,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:44,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2078374004, now seen corresponding path program 1 times [2023-11-28 20:36:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427496078] [2023-11-28 20:36:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:36:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:36:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:36:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:36:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:36:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:36:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-11-28 20:36:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427496078] [2023-11-28 20:36:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427496078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:46,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-28 20:36:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059809497] [2023-11-28 20:36:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:46,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:36:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:36:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-11-28 20:36:46,639 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-28 20:36:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:48,622 INFO L93 Difference]: Finished difference Result 156 states and 188 transitions. [2023-11-28 20:36:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:36:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) Word has length 117 [2023-11-28 20:36:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:48,625 INFO L225 Difference]: With dead ends: 156 [2023-11-28 20:36:48,625 INFO L226 Difference]: Without dead ends: 117 [2023-11-28 20:36:48,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2023-11-28 20:36:48,627 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 142 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:48,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 570 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:36:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-28 20:36:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2023-11-28 20:36:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.125) internal successors, (72), 66 states have internal predecessors, (72), 32 states have call successors, (32), 16 states have call predecessors, (32), 17 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-11-28 20:36:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2023-11-28 20:36:48,643 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 117 [2023-11-28 20:36:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:48,644 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2023-11-28 20:36:48,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.9375) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-28 20:36:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2023-11-28 20:36:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-28 20:36:48,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:48,646 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:48,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:36:48,646 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:48,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 441585930, now seen corresponding path program 1 times [2023-11-28 20:36:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271878737] [2023-11-28 20:36:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:36:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:36:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:36:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:36:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:36:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:36:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:36:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:36:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:36:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:36:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:36:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 20:36:56,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:56,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271878737] [2023-11-28 20:36:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271878737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:36:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72987548] [2023-11-28 20:36:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:56,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:36:56,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:56,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:36:56,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:36:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:57,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-28 20:36:57,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:59,078 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 11 treesize of output 7 [2023-11-28 20:36:59,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 63 [2023-11-28 20:36:59,298 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-28 20:36:59,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 95 [2023-11-28 20:37:00,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:37:01,000 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 298 treesize of output 258 [2023-11-28 20:37:01,087 INFO L349 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2023-11-28 20:37:01,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 581 treesize of output 533 [2023-11-28 20:37:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-28 20:37:01,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:37:13,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 131 [2023-11-28 20:37:13,921 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-28 20:37:13,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 87 [2023-11-28 20:37:13,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 131 [2023-11-28 20:37:13,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2023-11-28 20:37:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 20:37:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72987548] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:37:14,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:37:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 19] total 68 [2023-11-28 20:37:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114087866] [2023-11-28 20:37:14,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:37:14,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-28 20:37:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:14,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-28 20:37:14,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4343, Unknown=2, NotChecked=0, Total=4556 [2023-11-28 20:37:14,999 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 68 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 47 states have internal predecessors, (111), 22 states have call successors, (52), 13 states have call predecessors, (52), 15 states have return successors, (48), 24 states have call predecessors, (48), 17 states have call successors, (48) [2023-11-28 20:37:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:31,068 INFO L93 Difference]: Finished difference Result 219 states and 262 transitions. [2023-11-28 20:37:31,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-28 20:37:31,069 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 47 states have internal predecessors, (111), 22 states have call successors, (52), 13 states have call predecessors, (52), 15 states have return successors, (48), 24 states have call predecessors, (48), 17 states have call successors, (48) Word has length 117 [2023-11-28 20:37:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:31,071 INFO L225 Difference]: With dead ends: 219 [2023-11-28 20:37:31,071 INFO L226 Difference]: Without dead ends: 172 [2023-11-28 20:37:31,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=876, Invalid=11775, Unknown=5, NotChecked=0, Total=12656 [2023-11-28 20:37:31,076 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 485 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 4297 mSolverCounterSat, 414 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 4297 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:31,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1055 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 4297 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2023-11-28 20:37:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-28 20:37:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2023-11-28 20:37:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 100 states have internal predecessors, (110), 42 states have call successors, (42), 21 states have call predecessors, (42), 25 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-28 20:37:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2023-11-28 20:37:31,099 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 117 [2023-11-28 20:37:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:31,099 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2023-11-28 20:37:31,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 47 states have internal predecessors, (111), 22 states have call successors, (52), 13 states have call predecessors, (52), 15 states have return successors, (48), 24 states have call predecessors, (48), 17 states have call successors, (48) [2023-11-28 20:37:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2023-11-28 20:37:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-28 20:37:31,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:31,101 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:31,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:37:31,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:37:31,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:31,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash 697431638, now seen corresponding path program 1 times [2023-11-28 20:37:31,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:31,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198491396] [2023-11-28 20:37:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:37:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:37:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:37:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:37:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:37:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:37:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:37:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:37:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:37:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:37:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-28 20:37:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-28 20:37:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:32,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198491396] [2023-11-28 20:37:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198491396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:37:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681743114] [2023-11-28 20:37:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:32,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:37:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:37:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:37:32,175 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-28 20:37:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:33,172 INFO L93 Difference]: Finished difference Result 211 states and 253 transitions. [2023-11-28 20:37:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:37:33,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 118 [2023-11-28 20:37:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:33,174 INFO L225 Difference]: With dead ends: 211 [2023-11-28 20:37:33,174 INFO L226 Difference]: Without dead ends: 165 [2023-11-28 20:37:33,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:37:33,175 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 163 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:33,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 136 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:37:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-28 20:37:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-11-28 20:37:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 101 states have internal predecessors, (111), 42 states have call successors, (42), 21 states have call predecessors, (42), 25 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-28 20:37:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2023-11-28 20:37:33,210 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 118 [2023-11-28 20:37:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:33,211 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2023-11-28 20:37:33,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-28 20:37:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2023-11-28 20:37:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-28 20:37:33,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:33,213 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:37:33,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:37:33,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:37:33,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash 752885580, now seen corresponding path program 1 times [2023-11-28 20:37:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:37:33,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346567168] [2023-11-28 20:37:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:37:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:37:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:37:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:37:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:37:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:37:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:37:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:37:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:37:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:37:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:37:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:37:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:37:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:37:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:37:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:37:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-28 20:37:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 23 proven. 27 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-28 20:37:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:37:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346567168] [2023-11-28 20:37:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346567168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:37:45,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924944492] [2023-11-28 20:37:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:45,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:37:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:37:45,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:37:45,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:37:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:46,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-28 20:37:46,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:48,031 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 11 treesize of output 7 [2023-11-28 20:37:48,312 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_z_57 Int) (v_y_57 Int)) (let ((.cse1 (* 18446744073709551616 v_y_57))) (and (<= (+ v_z_57 1) (mod |c_#Ultimate.C_memcpy#3_size| 18446744073709551616)) (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse0 (+ v_z_57 |c_#Ultimate.C_memcpy#3_dest.offset| .cse1))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0 (select (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0)))) |c_#memory_int#3|) (<= 0 v_z_57) (<= 0 (+ v_z_57 .cse1))))) is different from true [2023-11-28 20:37:49,141 INFO L349 Elim1Store]: treesize reduction 135, result has 21.1 percent of original size [2023-11-28 20:37:49,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 137 [2023-11-28 20:37:49,229 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2023-11-28 20:37:49,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 23 [2023-11-28 20:37:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2023-11-28 20:37:49,250 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-11-28 20:37:49,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 29 [2023-11-28 20:37:49,391 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:37:49,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-11-28 20:37:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 72 trivial. 1 not checked. [2023-11-28 20:37:50,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:37:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924944492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:37:56,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:37:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 37] total 79 [2023-11-28 20:37:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519752229] [2023-11-28 20:37:56,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:37:56,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-11-28 20:37:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:37:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-11-28 20:37:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=7234, Unknown=1, NotChecked=170, Total=7656 [2023-11-28 20:37:56,225 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 79 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 53 states have internal predecessors, (94), 19 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 26 states have call predecessors, (41), 16 states have call successors, (41) [2023-11-28 20:38:19,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:38:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:38:27,631 INFO L93 Difference]: Finished difference Result 254 states and 306 transitions. [2023-11-28 20:38:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-28 20:38:27,632 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 53 states have internal predecessors, (94), 19 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 26 states have call predecessors, (41), 16 states have call successors, (41) Word has length 119 [2023-11-28 20:38:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:38:27,634 INFO L225 Difference]: With dead ends: 254 [2023-11-28 20:38:27,634 INFO L226 Difference]: Without dead ends: 252 [2023-11-28 20:38:27,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3955 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=970, Invalid=20495, Unknown=1, NotChecked=290, Total=21756 [2023-11-28 20:38:27,642 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 320 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 8785 mSolverCounterSat, 302 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 9350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 8785 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:27,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 2436 Invalid, 9350 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [302 Valid, 8785 Invalid, 21 Unknown, 242 Unchecked, 22.1s Time] [2023-11-28 20:38:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-28 20:38:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 168. [2023-11-28 20:38:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 100 states have (on average 1.16) internal successors, (116), 104 states have internal predecessors, (116), 42 states have call successors, (42), 21 states have call predecessors, (42), 25 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-28 20:38:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2023-11-28 20:38:27,696 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 119 [2023-11-28 20:38:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:38:27,696 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2023-11-28 20:38:27,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 53 states have internal predecessors, (94), 19 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 26 states have call predecessors, (41), 16 states have call successors, (41) [2023-11-28 20:38:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2023-11-28 20:38:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-28 20:38:27,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:27,698 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:38:27,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:38:27,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:38:27,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:38:27,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1807475096, now seen corresponding path program 2 times [2023-11-28 20:38:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:38:27,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165093582] [2023-11-28 20:38:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:27,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:38:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:38:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:38:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:38:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:38:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:38:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:38:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:38:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:38:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:38:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:38:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:38:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:38:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:38:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:38:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:38:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 20:38:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 20:38:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:38:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165093582] [2023-11-28 20:38:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165093582] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:38:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424973356] [2023-11-28 20:38:39,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:38:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:38:39,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:38:39,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:38:39,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:38:40,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:38:40,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:38:40,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 3022 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-28 20:38:40,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:41,522 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 11 treesize of output 7 [2023-11-28 20:38:41,769 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_16| Int)) (and (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse0 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_16|))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0 (select (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0)))) |c_#memory_int#3|) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_16| 1) |c_#Ultimate.C_memcpy#3_#t~loopctr1333|) (<= 0 |v_#Ultimate.C_memcpy#3_#t~loopctr1333_16|))) is different from true [2023-11-28 20:38:41,790 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_17| Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_16| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_16| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_17|) (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse1 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|)) (.cse2 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_17|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_16|))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2)))) |c_#memory_int#3|) (<= 0 |v_#Ultimate.C_memcpy#3_#t~loopctr1333_16|))) is different from true [2023-11-28 20:38:46,950 INFO L349 Elim1Store]: treesize reduction 325, result has 20.1 percent of original size [2023-11-28 20:38:46,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 202 [2023-11-28 20:38:47,228 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-28 20:38:47,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 26 [2023-11-28 20:38:47,295 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-28 20:38:47,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 26 [2023-11-28 20:38:47,439 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-28 20:38:47,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2023-11-28 20:38:47,450 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-28 20:38:47,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 29 [2023-11-28 20:38:47,472 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:38:47,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-28 20:38:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 81 trivial. 3 not checked. [2023-11-28 20:38:48,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:02,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424973356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:39:02,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:39:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 34] total 74 [2023-11-28 20:39:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239689456] [2023-11-28 20:39:02,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:02,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-28 20:39:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:39:02,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-28 20:39:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=6242, Unknown=4, NotChecked=318, Total=6806 [2023-11-28 20:39:02,074 INFO L87 Difference]: Start difference. First operand 168 states and 202 transitions. Second operand has 74 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 52 states have internal predecessors, (96), 16 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 22 states have call predecessors, (41), 13 states have call successors, (41) [2023-11-28 20:39:23,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:39:31,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:39:42,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:39:48,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:39:54,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:40:03,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:40:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:20,090 INFO L93 Difference]: Finished difference Result 284 states and 338 transitions. [2023-11-28 20:40:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-28 20:40:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 52 states have internal predecessors, (96), 16 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 22 states have call predecessors, (41), 13 states have call successors, (41) Word has length 120 [2023-11-28 20:40:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:20,095 INFO L225 Difference]: With dead ends: 284 [2023-11-28 20:40:20,095 INFO L226 Difference]: Without dead ends: 282 [2023-11-28 20:40:20,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=934, Invalid=16888, Unknown=8, NotChecked=530, Total=18360 [2023-11-28 20:40:20,101 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 425 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 5610 mSolverCounterSat, 349 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 6398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 5610 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 426 IncrementalHoareTripleChecker+Unchecked, 53.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:20,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1146 Invalid, 6398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 5610 Invalid, 13 Unknown, 426 Unchecked, 53.5s Time] [2023-11-28 20:40:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-28 20:40:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 169. [2023-11-28 20:40:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 105 states have internal predecessors, (118), 42 states have call successors, (42), 21 states have call predecessors, (42), 25 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-28 20:40:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 204 transitions. [2023-11-28 20:40:20,144 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 204 transitions. Word has length 120 [2023-11-28 20:40:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:20,144 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 204 transitions. [2023-11-28 20:40:20,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 52 states have internal predecessors, (96), 16 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 22 states have call predecessors, (41), 13 states have call successors, (41) [2023-11-28 20:40:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 204 transitions. [2023-11-28 20:40:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-28 20:40:20,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:20,146 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:20,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 20:40:20,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-28 20:40:20,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:20,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1823009514, now seen corresponding path program 3 times [2023-11-28 20:40:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581885986] [2023-11-28 20:40:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:40:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:40:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:40:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:40:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:40:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:40:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:40:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:40:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:40:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:40:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:40:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:40:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 20:40:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-28 20:40:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581885986] [2023-11-28 20:40:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581885986] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:40:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470322838] [2023-11-28 20:40:21,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:40:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:40:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:40:21,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:40:21,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 20:40:22,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-28 20:40:22,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:40:22,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 2648 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-28 20:40:22,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:40:22,147 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 11 treesize of output 7 [2023-11-28 20:40:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-11-28 20:40:22,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:40:27,743 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|))) (and (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_78 Int)) (let ((.cse0 (store .cse2 (+ v_z_78 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse1 (mod (select .cse0 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (= (mod (select .cse0 (+ .cse1 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (= (mod (select .cse0 (+ .cse1 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< v_z_78 9223372036854775808) (< 18446744073709551615 v_z_78))))))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_78 Int)) (let ((.cse3 (store .cse2 (+ v_z_78 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse4 (mod (select .cse3 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (= (mod (select .cse3 (+ .cse4 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< v_z_78 9223372036854775808) (< .cse4 9223372036854775808) (< 18446744073709551615 v_z_78))))))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_73 Int)) (let ((.cse6 (store .cse2 (+ v_z_73 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse5 (mod (select .cse6 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (< 9223372036854775807 v_z_73) (< 9223372036854775807 .cse5) (< v_z_73 0) (= (mod (select .cse6 (+ 16 .cse5 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0))))))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_73 Int)) (let ((.cse7 (store .cse2 (+ v_z_73 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse8 (mod (select .cse7 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (< 9223372036854775807 v_z_73) (= 0 (mod (select .cse7 (+ (- 18446744073709551600) .cse8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256)) (< v_z_73 0) (= (mod (select .cse7 (+ 16 .cse8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0))))))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (forall ((v_z_78 Int)) (let ((.cse9 (store .cse2 (+ v_z_78 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse10 (mod (select .cse9 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (= (mod (select .cse9 (+ .cse10 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< v_z_78 9223372036854775808) (< 9223372036854775807 .cse10) (< 18446744073709551615 v_z_78))))) (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_75 Int)) (let ((.cse12 (store .cse2 (+ v_z_75 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse11 (mod (select .cse12 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (< v_z_75 0) (< .cse11 9223372036854775808) (= (mod (select .cse12 (+ .cse11 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< 9223372036854775807 v_z_75))))))))) is different from false [2023-11-28 20:40:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 2 not checked. [2023-11-28 20:40:31,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470322838] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:40:31,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:40:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 15] total 38 [2023-11-28 20:40:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946733518] [2023-11-28 20:40:31,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:40:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-28 20:40:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:31,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-28 20:40:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1234, Unknown=1, NotChecked=70, Total=1406 [2023-11-28 20:40:31,029 INFO L87 Difference]: Start difference. First operand 169 states and 204 transitions. Second operand has 38 states, 31 states have (on average 2.774193548387097) internal successors, (86), 27 states have internal predecessors, (86), 5 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2023-11-28 20:40:47,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:40:51,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:40:56,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:00,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:04,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:08,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:12,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:16,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:20,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:24,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:28,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:32,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:36,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:40,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:44,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:48,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:52,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:41:56,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:00,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:04,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:08,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:12,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:16,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:20,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:28,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:32,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:36,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:40,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:44,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:48,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:52,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:42:56,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:43:00,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:43:04,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:43:08,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:43:12,865 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|))) (and (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_78 Int)) (let ((.cse0 (store .cse2 (+ v_z_78 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse1 (mod (select .cse0 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (= (mod (select .cse0 (+ .cse1 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (= (mod (select .cse0 (+ .cse1 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< v_z_78 9223372036854775808) (< 18446744073709551615 v_z_78))))))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_78 Int)) (let ((.cse3 (store .cse2 (+ v_z_78 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse4 (mod (select .cse3 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (= (mod (select .cse3 (+ .cse4 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< v_z_78 9223372036854775808) (< .cse4 9223372036854775808) (< 18446744073709551615 v_z_78))))))) (= |c_#valid| |c_old(#valid)|) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_73 Int)) (let ((.cse6 (store .cse2 (+ v_z_73 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse5 (mod (select .cse6 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (< 9223372036854775807 v_z_73) (< 9223372036854775807 .cse5) (< v_z_73 0) (= (mod (select .cse6 (+ 16 .cse5 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0))))))) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_73 Int)) (let ((.cse7 (store .cse2 (+ v_z_73 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse8 (mod (select .cse7 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (< 9223372036854775807 v_z_73) (= 0 (mod (select .cse7 (+ (- 18446744073709551600) .cse8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256)) (< v_z_73 0) (= (mod (select .cse7 (+ 16 .cse8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0))))))) (= |c_#memory_int#5| |c_old(#memory_int#5)|) (= |c_old(#memory_$Pointer$#5.base)| |c_#memory_$Pointer$#5.base|) (= |c_#memory_real#5| |c_old(#memory_real#5)|) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (forall ((v_z_78 Int)) (let ((.cse9 (store .cse2 (+ v_z_78 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse10 (mod (select .cse9 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (= (mod (select .cse9 (+ .cse10 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< v_z_78 9223372036854775808) (< 9223372036854775807 .cse10) (< 18446744073709551615 v_z_78))))) (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)))) (= |c_old(#memory_$Pointer$#5.offset)| |c_#memory_$Pointer$#5.offset|) (forall ((v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13 Int)) (or (< |c_#Ultimate.C_memcpy#3_dest.offset| (+ 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) (forall ((v_z_75 Int)) (let ((.cse12 (store .cse2 (+ v_z_75 16 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13) 0))) (let ((.cse11 (mod (select .cse12 (+ 8 v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 18446744073709551616))) (or (< v_z_75 0) (< .cse11 9223372036854775808) (= (mod (select .cse12 (+ .cse11 (- 18446744073709551600) v_aws_string_new_from_array_~str~2.offset_BEFORE_CALL_13)) 256) 0) (< 9223372036854775807 v_z_75))))))) (= |c_old(#length)| |c_#length|) (= |c_old(~tl_last_error~0)| c_~tl_last_error~0))) is different from false [2023-11-28 20:43:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:16,684 INFO L93 Difference]: Finished difference Result 250 states and 303 transitions. [2023-11-28 20:43:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-28 20:43:16,684 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.774193548387097) internal successors, (86), 27 states have internal predecessors, (86), 5 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) Word has length 120 [2023-11-28 20:43:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:16,686 INFO L225 Difference]: With dead ends: 250 [2023-11-28 20:43:16,686 INFO L226 Difference]: Without dead ends: 203 [2023-11-28 20:43:16,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=387, Invalid=4311, Unknown=2, NotChecked=270, Total=4970 [2023-11-28 20:43:16,687 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 199 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 162 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 154.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 155.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:16,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 977 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2656 Invalid, 36 Unknown, 251 Unchecked, 155.2s Time] [2023-11-28 20:43:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-28 20:43:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 182. [2023-11-28 20:43:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 115 states have internal predecessors, (130), 44 states have call successors, (44), 22 states have call predecessors, (44), 27 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-28 20:43:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2023-11-28 20:43:16,740 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 120 [2023-11-28 20:43:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:16,740 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2023-11-28 20:43:16,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.774193548387097) internal successors, (86), 27 states have internal predecessors, (86), 5 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2023-11-28 20:43:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2023-11-28 20:43:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-28 20:43:16,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:16,741 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:43:16,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 20:43:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-28 20:43:16,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:16,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 140011724, now seen corresponding path program 4 times [2023-11-28 20:43:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227972619] [2023-11-28 20:43:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:43:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:43:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:43:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:43:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:43:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:43:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:43:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:43:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:43:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:43:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:43:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:43:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:43:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:32,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:43:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-28 20:43:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227972619] [2023-11-28 20:43:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227972619] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513754846] [2023-11-28 20:43:33,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:43:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:43:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:43:33,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:43:33,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 20:43:33,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:43:33,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:43:33,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 3150 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-28 20:43:33,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:36,429 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 11 treesize of output 7 [2023-11-28 20:43:50,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:43:50,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:43:50,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:43:50,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:43:50,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:43:50,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 11 [2023-11-28 20:43:50,734 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:43:50,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-11-28 20:43:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-28 20:43:52,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513754846] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:57,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:43:57,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39] total 82 [2023-11-28 20:43:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744664607] [2023-11-28 20:43:57,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:43:57,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-11-28 20:43:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-11-28 20:43:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=7925, Unknown=9, NotChecked=0, Total=8190 [2023-11-28 20:43:57,161 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand has 82 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 56 states have internal predecessors, (98), 19 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 26 states have call predecessors, (41), 16 states have call successors, (41) [2023-11-28 20:44:36,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:44:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:47,445 INFO L93 Difference]: Finished difference Result 299 states and 356 transitions. [2023-11-28 20:44:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-28 20:44:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 56 states have internal predecessors, (98), 19 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 26 states have call predecessors, (41), 16 states have call successors, (41) Word has length 121 [2023-11-28 20:44:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:47,448 INFO L225 Difference]: With dead ends: 299 [2023-11-28 20:44:47,448 INFO L226 Difference]: Without dead ends: 297 [2023-11-28 20:44:47,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4196 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=994, Invalid=21949, Unknown=9, NotChecked=0, Total=22952 [2023-11-28 20:44:47,453 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 294 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 10413 mSolverCounterSat, 247 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 10667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 10413 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:47,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 2457 Invalid, 10667 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [247 Valid, 10413 Invalid, 7 Unknown, 0 Unchecked, 36.9s Time] [2023-11-28 20:44:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-28 20:44:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 180. [2023-11-28 20:44:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 113 states have internal predecessors, (127), 44 states have call successors, (44), 22 states have call predecessors, (44), 27 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-28 20:44:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 218 transitions. [2023-11-28 20:44:47,524 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 218 transitions. Word has length 121 [2023-11-28 20:44:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:47,524 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 218 transitions. [2023-11-28 20:44:47,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 56 states have internal predecessors, (98), 19 states have call successors, (43), 10 states have call predecessors, (43), 17 states have return successors, (41), 26 states have call predecessors, (41), 16 states have call successors, (41) [2023-11-28 20:44:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 218 transitions. [2023-11-28 20:44:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-28 20:44:47,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:47,526 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:47,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-28 20:44:47,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-28 20:44:47,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:47,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -11745256, now seen corresponding path program 5 times [2023-11-28 20:44:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:44:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444216916] [2023-11-28 20:44:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:44:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:00,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:45:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:45:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:45:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:45:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:45:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:45:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:45:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:45:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:45:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:45:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:45:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:45:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:45:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:45:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:05,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-28 20:45:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 20:45:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:45:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444216916] [2023-11-28 20:45:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444216916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:45:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970148639] [2023-11-28 20:45:06,579 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:45:06,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:45:06,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:45:06,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:45:06,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-28 20:45:16,361 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-28 20:45:16,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:45:16,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 218 conjunts are in the unsatisfiable core [2023-11-28 20:45:16,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:45:17,866 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 13 treesize of output 9 [2023-11-28 20:45:18,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-28 20:45:20,844 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 11 treesize of output 7 [2023-11-28 20:45:21,644 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_50| Int)) (and (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse0 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|)) (.cse3 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_50|))) (store (let ((.cse2 (+ |c_#Ultimate.C_memcpy#3_dest.offset| 2))) (store (let ((.cse1 (+ |c_#Ultimate.C_memcpy#3_dest.offset| 1))) (store (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) |c_#Ultimate.C_memcpy#3_dest.offset| (select .cse0 |c_#Ultimate.C_memcpy#3_dest.offset|)) .cse1 (select .cse0 .cse1))) .cse2 (select .cse0 .cse2))) .cse3 (select .cse0 .cse3)))) |c_#memory_int#3|) (<= 3 |v_#Ultimate.C_memcpy#3_#t~loopctr1333_50|))) is different from true [2023-11-28 20:45:22,037 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_50| Int)) (and (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse1 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_50|))) (store (let ((.cse2 (+ |c_#Ultimate.C_memcpy#3_dest.offset| 2))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#3_dest.offset| 1))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) |c_#Ultimate.C_memcpy#3_dest.offset| (select .cse1 |c_#Ultimate.C_memcpy#3_dest.offset|)))) |c_#memory_int#3|) (<= 3 |v_#Ultimate.C_memcpy#3_#t~loopctr1333_50|))) is different from true [2023-11-28 20:45:22,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:45:22,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:45:22,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:45:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:45:22,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2023-11-28 20:45:22,094 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:45:22,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-28 20:45:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 72 trivial. 5 not checked. [2023-11-28 20:45:24,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:45:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970148639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:45:41,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:45:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 50] total 90 [2023-11-28 20:45:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74556852] [2023-11-28 20:45:41,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:45:41,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-11-28 20:45:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:45:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-11-28 20:45:41,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=9062, Unknown=2, NotChecked=382, Total=9702 [2023-11-28 20:45:41,323 INFO L87 Difference]: Start difference. First operand 180 states and 218 transitions. Second operand has 90 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 65 states have internal predecessors, (103), 24 states have call successors, (44), 10 states have call predecessors, (44), 20 states have return successors, (42), 29 states have call predecessors, (42), 21 states have call successors, (42) [2023-11-28 20:46:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:46:41,419 INFO L93 Difference]: Finished difference Result 270 states and 335 transitions. [2023-11-28 20:46:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-11-28 20:46:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 65 states have internal predecessors, (103), 24 states have call successors, (44), 10 states have call predecessors, (44), 20 states have return successors, (42), 29 states have call predecessors, (42), 21 states have call successors, (42) Word has length 122 [2023-11-28 20:46:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:46:41,422 INFO L225 Difference]: With dead ends: 270 [2023-11-28 20:46:41,422 INFO L226 Difference]: Without dead ends: 268 [2023-11-28 20:46:41,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 176 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5693 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=1294, Invalid=29512, Unknown=2, NotChecked=698, Total=31506 [2023-11-28 20:46:41,425 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 512 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 9986 mSolverCounterSat, 477 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 10971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 9986 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:46:41,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1457 Invalid, 10971 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [477 Valid, 9986 Invalid, 7 Unknown, 501 Unchecked, 42.6s Time] [2023-11-28 20:46:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-28 20:46:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 183. [2023-11-28 20:46:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 116 states have internal predecessors, (132), 44 states have call successors, (44), 22 states have call predecessors, (44), 27 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-28 20:46:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2023-11-28 20:46:41,481 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 223 transitions. Word has length 122 [2023-11-28 20:46:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:46:41,482 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 223 transitions. [2023-11-28 20:46:41,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 65 states have internal predecessors, (103), 24 states have call successors, (44), 10 states have call predecessors, (44), 20 states have return successors, (42), 29 states have call predecessors, (42), 21 states have call successors, (42) [2023-11-28 20:46:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 223 transitions. [2023-11-28 20:46:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-28 20:46:41,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:46:41,483 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:46:41,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-28 20:46:41,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-28 20:46:41,684 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:46:41,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:46:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash -223135784, now seen corresponding path program 6 times [2023-11-28 20:46:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:46:41,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776117477] [2023-11-28 20:46:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:46:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:46:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:46:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:46:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:46:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:46:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:46:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:46:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:46:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:46:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:46:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:46:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:46:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:46:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:46:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:46:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-28 20:46:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-28 20:46:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:46:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776117477] [2023-11-28 20:46:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776117477] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:46:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029054699] [2023-11-28 20:46:42,923 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-28 20:46:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:46:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:46:42,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:46:42,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-28 20:46:52,269 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-28 20:46:52,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:46:52,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-28 20:46:52,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:46:52,504 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 11 treesize of output 7 [2023-11-28 20:46:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-11-28 20:46:52,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:46:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-28 20:46:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029054699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:46:59,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:46:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 17] total 43 [2023-11-28 20:46:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396426358] [2023-11-28 20:46:59,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:46:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-28 20:46:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:46:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-28 20:46:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2023-11-28 20:46:59,275 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. Second operand has 43 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 32 states have internal predecessors, (92), 5 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2023-11-28 20:47:28,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:47:32,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:47:36,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:47:40,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-28 20:47:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:51,100 INFO L93 Difference]: Finished difference Result 276 states and 336 transitions. [2023-11-28 20:47:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-28 20:47:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 32 states have internal predecessors, (92), 5 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) Word has length 122 [2023-11-28 20:47:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:51,103 INFO L225 Difference]: With dead ends: 276 [2023-11-28 20:47:51,103 INFO L226 Difference]: Without dead ends: 220 [2023-11-28 20:47:51,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=556, Invalid=6249, Unknown=1, NotChecked=0, Total=6806 [2023-11-28 20:47:51,106 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 334 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 237 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:51,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1033 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 3120 Invalid, 2 Unknown, 0 Unchecked, 35.9s Time] [2023-11-28 20:47:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-28 20:47:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 188. [2023-11-28 20:47:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 121 states have internal predecessors, (141), 44 states have call successors, (44), 22 states have call predecessors, (44), 27 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-28 20:47:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 232 transitions. [2023-11-28 20:47:51,257 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 232 transitions. Word has length 122 [2023-11-28 20:47:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:51,258 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 232 transitions. [2023-11-28 20:47:51,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 32 states have internal predecessors, (92), 5 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2023-11-28 20:47:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2023-11-28 20:47:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-28 20:47:51,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:51,260 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:47:51,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-28 20:47:51,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-28 20:47:51,461 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:51,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -421244340, now seen corresponding path program 7 times [2023-11-28 20:47:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43929762] [2023-11-28 20:47:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:48:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:48:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:48:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:48:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:48:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:48:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:48:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:48:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-28 20:48:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:48:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:48:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:48:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-28 20:48:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:48:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-28 20:48:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:09,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-28 20:48:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-28 20:48:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:48:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43929762] [2023-11-28 20:48:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43929762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:48:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131421750] [2023-11-28 20:48:10,257 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-28 20:48:10,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:48:10,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:48:10,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:48:10,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb743124-b08b-4637-8b11-c187c46bf964/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-28 20:48:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:11,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 3406 conjuncts, 150 conjunts are in the unsatisfiable core [2023-11-28 20:48:11,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:48:13,222 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 11 treesize of output 7 [2023-11-28 20:48:13,611 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_108 Int) (v_z_108 Int)) (let ((.cse1 (* 18446744073709551616 v_y_108))) (and (<= 0 v_z_108) (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse0 (+ |c_#Ultimate.C_memcpy#3_dest.offset| v_z_108 .cse1))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0 (select (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0)))) |c_#memory_int#3|) (<= 0 (+ v_z_108 .cse1)) (<= (+ v_z_108 1) (mod |c_#Ultimate.C_memcpy#3_size| 18446744073709551616)) (<= (+ v_z_108 .cse1 1) |c_#Ultimate.C_memcpy#3_#t~loopctr1333|)))) is different from true [2023-11-28 20:48:13,655 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| Int) (v_y_108 Int) (v_z_108 Int)) (let ((.cse2 (* 18446744073709551616 v_y_108))) (and (<= 0 v_z_108) (= |c_#memory_int#3| (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse1 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|)) (.cse3 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#3_dest.offset| v_z_108 .cse2))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse0 (select .cse1 .cse0))) .cse3 (select .cse1 .cse3))))) (<= (+ v_z_108 .cse2 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|) (<= 0 (+ v_z_108 .cse2)) (<= (+ v_z_108 1) (mod |c_#Ultimate.C_memcpy#3_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| 1) |c_#Ultimate.C_memcpy#3_#t~loopctr1333|)))) is different from true [2023-11-28 20:48:13,757 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_72| Int) (v_y_108 Int) (v_z_108 Int)) (let ((.cse0 (* 18446744073709551616 v_y_108))) (and (<= 0 v_z_108) (<= (+ v_z_108 .cse0 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|) (<= 0 (+ v_z_108 .cse0)) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72| 1) |c_#Ultimate.C_memcpy#3_#t~loopctr1333|) (<= (+ v_z_108 1) (mod |c_#Ultimate.C_memcpy#3_size| 18446744073709551616)) (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse2 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|)) (.cse4 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|))) (store (let ((.cse1 (+ |c_#Ultimate.C_memcpy#3_dest.offset| v_z_108 .cse0))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse1 (select .cse2 .cse1))) .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4)))) |c_#memory_int#3|) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72|)))) is different from true [2023-11-28 20:48:13,861 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_72| Int) (v_y_108 Int) (v_z_108 Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_73| Int)) (let ((.cse0 (* 18446744073709551616 v_y_108))) (and (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_73|) (<= 0 v_z_108) (<= (+ v_z_108 .cse0 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|) (<= 0 (+ v_z_108 .cse0)) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_73| 1) |c_#Ultimate.C_memcpy#3_#t~loopctr1333|) (<= (+ v_z_108 1) (mod |c_#Ultimate.C_memcpy#3_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72|) (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse2 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|)) (.cse5 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_73|))) (store (let ((.cse4 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|))) (store (let ((.cse1 (+ |c_#Ultimate.C_memcpy#3_dest.offset| v_z_108 .cse0))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse1 (select .cse2 .cse1))) .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4))) .cse5 (select .cse2 .cse5)))) |c_#memory_int#3|)))) is different from true [2023-11-28 20:48:14,362 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_72| Int) (v_y_108 Int) (v_z_108 Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_73| Int) (|v_#Ultimate.C_memcpy#3_#t~loopctr1333_74| Int)) (let ((.cse0 (* 18446744073709551616 v_y_108))) (and (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_73|) (<= 0 v_z_108) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_73| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_74|) (<= (+ v_z_108 .cse0 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|) (<= 0 (+ v_z_108 .cse0)) (= (store |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base| (let ((.cse2 (select |c_#memory_int#3| |c_#Ultimate.C_memcpy#3_dest.base|)) (.cse6 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_74|))) (store (let ((.cse5 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_73|))) (store (let ((.cse4 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#3_dest.offset| |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71|))) (store (let ((.cse1 (+ |c_#Ultimate.C_memcpy#3_dest.offset| v_z_108 .cse0))) (store (select |c_old(#memory_int#3)| |c_#Ultimate.C_memcpy#3_dest.base|) .cse1 (select .cse2 .cse1))) .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4))) .cse5 (select .cse2 .cse5))) .cse6 (select .cse2 .cse6)))) |c_#memory_int#3|) (<= (+ v_z_108 1) (mod |c_#Ultimate.C_memcpy#3_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy#3_#t~loopctr1333_71| 1) |v_#Ultimate.C_memcpy#3_#t~loopctr1333_72|)))) is different from true