./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:08:37,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:08:37,600 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 03:08:37,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:08:37,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:08:37,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:08:37,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:08:37,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:08:37,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:08:37,653 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:08:37,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:08:37,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:08:37,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:08:37,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:08:37,656 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:08:37,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:08:37,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:08:37,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:08:37,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:08:37,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:08:37,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:08:37,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:08:37,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:08:37,660 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:08:37,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:08:37,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:08:37,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:08:37,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:08:37,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:08:37,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:08:37,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:08:37,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:08:37,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:08:37,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:08:37,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:08:37,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:08:37,664 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:08:37,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:08:37,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:08:37,665 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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2023-11-29 03:08:37,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:08:37,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:08:37,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:08:37,933 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:08:37,934 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:08:37,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2023-11-29 03:08:40,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:08:41,181 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:08:41,182 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2023-11-29 03:08:41,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/data/a300bb527/15e1c646353d4a04acfef99720cef0f1/FLAGe0c7a63ec [2023-11-29 03:08:41,225 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/data/a300bb527/15e1c646353d4a04acfef99720cef0f1 [2023-11-29 03:08:41,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:08:41,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:08:41,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:08:41,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:08:41,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:08:41,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:08:41" (1/1) ... [2023-11-29 03:08:41,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa8685b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:41, skipping insertion in model container [2023-11-29 03:08:41,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:08:41" (1/1) ... [2023-11-29 03:08:41,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:08:41,583 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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2023-11-29 03:08:41,591 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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2023-11-29 03:08:42,544 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,545 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,545 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,546 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,547 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,561 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,562 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,563 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,564 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:42,940 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 03:08:42,941 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 03:08:42,942 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 03:08:42,943 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 03:08:42,945 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 03:08:42,946 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 03:08:42,946 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 03:08:42,947 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 03:08:42,948 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 03:08:42,948 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 03:08:43,186 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,187 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:08:43,308 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:08:43,320 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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2023-11-29 03:08:43,321 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_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2023-11-29 03:08:43,360 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,361 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,361 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,362 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,370 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,371 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,372 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,373 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,403 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 03:08:43,404 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 03:08:43,405 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 03:08:43,406 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 03:08:43,407 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 03:08:43,408 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 03:08:43,408 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 03:08:43,409 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 03:08:43,410 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 03:08:43,410 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 03:08:43,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-29 03:08:43,510 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,511 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:08:43,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-29 03:08:43,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,754 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,755 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,755 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,755 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,755 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,755 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,756 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,756 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,756 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,756 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,756 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,756 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:43,763 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:08:43,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43 WrapperNode [2023-11-29 03:08:43,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:08:43,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:08:43,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:08:43,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:08:43,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:43,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:43,932 INFO L138 Inliner]: procedures = 689, calls = 2738, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 813 [2023-11-29 03:08:43,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:08:43,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:08:43,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:08:43,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:08:43,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:43,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:43,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,020 INFO L175 MemorySlicer]: Split 518 memory accesses to 7 slices as follows [2, 2, 256, 236, 14, 5, 3]. 49 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 0, 256, 236, 0, 5, 3]. The 5 writes are split as follows [0, 1, 0, 0, 4, 0, 0]. [2023-11-29 03:08:44,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:08:44,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:08:44,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:08:44,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:08:44,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (1/1) ... [2023-11-29 03:08:44,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:08:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:08:44,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:08:44,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:08:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-29 03:08:44,190 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-29 03:08:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:08:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-29 03:08:44,190 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#0 [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#1 [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#2 [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#3 [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#4 [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#5 [2023-11-29 03:08:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#6 [2023-11-29 03:08:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-29 03:08:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-29 03:08:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-29 03:08:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-29 03:08:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 03:08:44,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:08:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 03:08:44,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 03:08:44,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 03:08:44,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 03:08:44,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-29 03:08:44,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-29 03:08:44,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-29 03:08:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-29 03:08:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-29 03:08:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-29 03:08:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-29 03:08:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-29 03:08:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-29 03:08:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-29 03:08:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-29 03:08:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-29 03:08:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-29 03:08:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-29 03:08:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-29 03:08:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-29 03:08:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:08:44,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 03:08:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 03:08:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:08:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:08:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-29 03:08:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-29 03:08:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-29 03:08:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-29 03:08:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-29 03:08:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-29 03:08:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-29 03:08:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-29 03:08:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-29 03:08:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 03:08:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 03:08:44,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 03:08:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 03:08:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 03:08:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 03:08:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 03:08:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-29 03:08:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-29 03:08:44,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:08:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:08:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-29 03:08:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-29 03:08:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:08:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-29 03:08:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-29 03:08:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:08:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:08:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:08:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 03:08:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 03:08:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 03:08:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 03:08:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2023-11-29 03:08:44,204 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2023-11-29 03:08:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-29 03:08:44,204 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-29 03:08:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-29 03:08:44,205 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-29 03:08:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 03:08:44,205 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 03:08:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:08:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:08:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:08:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#0 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#1 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#2 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#3 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#4 [2023-11-29 03:08:44,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#5 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#6 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 03:08:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 03:08:44,511 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:08:44,514 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:08:45,399 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2023-11-29 03:08:46,285 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:08:46,420 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:08:46,420 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 03:08:46,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:46 BoogieIcfgContainer [2023-11-29 03:08:46,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:08:46,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:08:46,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:08:46,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:08:46,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:08:41" (1/3) ... [2023-11-29 03:08:46,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d1b809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:08:46, skipping insertion in model container [2023-11-29 03:08:46,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:43" (2/3) ... [2023-11-29 03:08:46,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d1b809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:08:46, skipping insertion in model container [2023-11-29 03:08:46,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:46" (3/3) ... [2023-11-29 03:08:46,431 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2023-11-29 03:08:46,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:08:46,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:08:46,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:08:46,517 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;@7b561c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:08:46,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:08:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-29 03:08:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 03:08:46,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:46,535 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:08:46,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:46,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1096751327, now seen corresponding path program 1 times [2023-11-29 03:08:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22963052] [2023-11-29 03:08:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:08:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:08:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:08:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:08:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:08:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:08:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:08:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 03:08:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:47,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22963052] [2023-11-29 03:08:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22963052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:47,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:47,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:08:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468921962] [2023-11-29 03:08:47,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:47,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:08:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:47,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:08:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:08:47,390 INFO L87 Difference]: Start difference. First operand has 116 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 2 states have internal predecessors, (27), 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-29 03:08:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:48,151 INFO L93 Difference]: Finished difference Result 241 states and 328 transitions. [2023-11-29 03:08:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:08:48,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 2 states have internal predecessors, (27), 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 67 [2023-11-29 03:08:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:48,165 INFO L225 Difference]: With dead ends: 241 [2023-11-29 03:08:48,165 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 03:08:48,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-29 03:08:48,174 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:48,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 135 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:08:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 03:08:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2023-11-29 03:08:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 03:08:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 143 transitions. [2023-11-29 03:08:48,238 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 143 transitions. Word has length 67 [2023-11-29 03:08:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:48,238 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 143 transitions. [2023-11-29 03:08:48,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 2 states have internal predecessors, (27), 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-29 03:08:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2023-11-29 03:08:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 03:08:48,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:48,243 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:08:48,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:08:48,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:48,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -360927773, now seen corresponding path program 1 times [2023-11-29 03:08:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060222720] [2023-11-29 03:08:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:08:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:08:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:08:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:08:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:08:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:49,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:08:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:49,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:08:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 03:08:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060222720] [2023-11-29 03:08:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060222720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:49,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:49,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:08:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715518029] [2023-11-29 03:08:49,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:49,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:08:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:08:49,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:08:49,183 INFO L87 Difference]: Start difference. First operand 114 states and 143 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 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-29 03:08:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:50,266 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2023-11-29 03:08:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:08:50,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 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 67 [2023-11-29 03:08:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:50,269 INFO L225 Difference]: With dead ends: 171 [2023-11-29 03:08:50,269 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 03:08:50,270 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-29 03:08:50,272 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:50,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 306 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:08:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 03:08:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2023-11-29 03:08:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2023-11-29 03:08:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2023-11-29 03:08:50,296 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 67 [2023-11-29 03:08:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:50,297 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2023-11-29 03:08:50,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 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-29 03:08:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2023-11-29 03:08:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 03:08:50,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:50,301 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:08:50,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:08:50,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:50,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash 356966852, now seen corresponding path program 1 times [2023-11-29 03:08:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178691067] [2023-11-29 03:08:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:08:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:08:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:08:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:08:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:08:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:08:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:08:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 03:08:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178691067] [2023-11-29 03:08:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178691067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:08:51,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64202698] [2023-11-29 03:08:51,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:51,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:08:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:08:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:08:51,308 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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-29 03:08:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:52,277 INFO L93 Difference]: Finished difference Result 187 states and 237 transitions. [2023-11-29 03:08:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:08:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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 71 [2023-11-29 03:08:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:52,281 INFO L225 Difference]: With dead ends: 187 [2023-11-29 03:08:52,281 INFO L226 Difference]: Without dead ends: 151 [2023-11-29 03:08:52,282 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-29 03:08:52,283 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 105 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:52,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 316 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:08:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-29 03:08:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2023-11-29 03:08:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-29 03:08:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2023-11-29 03:08:52,305 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 71 [2023-11-29 03:08:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:52,306 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2023-11-29 03:08:52,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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-29 03:08:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2023-11-29 03:08:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 03:08:52,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:52,309 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:08:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:08:52,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:52,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1112468574, now seen corresponding path program 1 times [2023-11-29 03:08:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889298046] [2023-11-29 03:08:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:08:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:08:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:08:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:08:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:08:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:08:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:08:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 03:08:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889298046] [2023-11-29 03:08:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889298046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 03:08:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769183531] [2023-11-29 03:08:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:53,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:08:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:53,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:08:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:08:53,545 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 03:08:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:54,974 INFO L93 Difference]: Finished difference Result 155 states and 196 transitions. [2023-11-29 03:08:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:08:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 72 [2023-11-29 03:08:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:54,977 INFO L225 Difference]: With dead ends: 155 [2023-11-29 03:08:54,978 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 03:08:54,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:08:54,980 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 130 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:54,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 542 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 03:08:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 03:08:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 111. [2023-11-29 03:08:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 03:08:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2023-11-29 03:08:55,006 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 72 [2023-11-29 03:08:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:55,006 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2023-11-29 03:08:55,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 03:08:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2023-11-29 03:08:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:08:55,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:55,010 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 03:08:55,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:08:55,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:55,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2118494894, now seen corresponding path program 1 times [2023-11-29 03:08:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103891208] [2023-11-29 03:08:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:08:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:08:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:08:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:08:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:08:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:08:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:08:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:08:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:08:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:08:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:08:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:08:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:56,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 03:08:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 03:08:56,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103891208] [2023-11-29 03:08:56,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103891208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:56,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:56,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:08:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911059025] [2023-11-29 03:08:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:56,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:08:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:56,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:08:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:08:56,136 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 5 states have internal predecessors, (46), 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-29 03:08:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:08:57,638 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2023-11-29 03:08:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:08:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 5 states have internal predecessors, (46), 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 110 [2023-11-29 03:08:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:08:57,641 INFO L225 Difference]: With dead ends: 174 [2023-11-29 03:08:57,641 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 03:08:57,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:08:57,644 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 103 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:08:57,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 279 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:08:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 03:08:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2023-11-29 03:08:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-29 03:08:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2023-11-29 03:08:57,665 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 110 [2023-11-29 03:08:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:08:57,666 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2023-11-29 03:08:57,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 5 states have internal predecessors, (46), 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-29 03:08:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2023-11-29 03:08:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:08:57,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:08:57,670 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1] [2023-11-29 03:08:57,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:08:57,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:08:57,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1151817676, now seen corresponding path program 1 times [2023-11-29 03:08:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:57,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596365506] [2023-11-29 03:08:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:57,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:08:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:08:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:08:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:08:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:08:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:08:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:08:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:08:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:08:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:08:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:08:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:08:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:08:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:08:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 03:08:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:08:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 03:08:58,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596365506] [2023-11-29 03:08:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596365506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:08:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237947091] [2023-11-29 03:08:58,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:58,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:08:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:08:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:08:58,742 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 5 states have internal predecessors, (48), 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-29 03:09:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:00,292 INFO L93 Difference]: Finished difference Result 186 states and 231 transitions. [2023-11-29 03:09:00,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:09:00,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 5 states have internal predecessors, (48), 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 114 [2023-11-29 03:09:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:00,295 INFO L225 Difference]: With dead ends: 186 [2023-11-29 03:09:00,295 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 03:09:00,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:09:00,298 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 164 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:00,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 313 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 03:09:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 03:09:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2023-11-29 03:09:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 62 states have internal predecessors, (68), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 03:09:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2023-11-29 03:09:00,317 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 114 [2023-11-29 03:09:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:00,318 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2023-11-29 03:09:00,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 5 states have internal predecessors, (48), 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-29 03:09:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2023-11-29 03:09:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 03:09:00,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:00,321 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-29 03:09:00,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:09:00,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:00,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1950233647, now seen corresponding path program 1 times [2023-11-29 03:09:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867813635] [2023-11-29 03:09:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:09:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:09:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:09:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:09:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:09:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:09:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:09:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:02,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:09:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:09:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-29 03:09:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867813635] [2023-11-29 03:09:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867813635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 03:09:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365447032] [2023-11-29 03:09:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:02,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:09:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:09:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:09:02,332 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 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-29 03:09:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:04,690 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2023-11-29 03:09:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:09:04,690 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 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 120 [2023-11-29 03:09:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:04,692 INFO L225 Difference]: With dead ends: 155 [2023-11-29 03:09:04,692 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 03:09:04,694 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-29 03:09:04,694 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 139 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:04,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 571 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 03:09:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 03:09:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2023-11-29 03:09:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.125) internal successors, (72), 66 states have internal predecessors, (72), 32 states have call successors, (32), 15 states have call predecessors, (32), 16 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-11-29 03:09:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2023-11-29 03:09:04,710 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 120 [2023-11-29 03:09:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:04,711 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2023-11-29 03:09:04,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 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-29 03:09:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2023-11-29 03:09:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 03:09:04,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:04,713 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-29 03:09:04,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:09:04,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:04,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 569726287, now seen corresponding path program 1 times [2023-11-29 03:09:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390207204] [2023-11-29 03:09:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:09:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:09:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:09:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:09:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:09:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:09:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:09:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:09:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 03:09:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-29 03:09:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390207204] [2023-11-29 03:09:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390207204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:13,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-11-29 03:09:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791065712] [2023-11-29 03:09:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:13,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 03:09:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 03:09:13,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2023-11-29 03:09:13,015 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand has 30 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 20 states have internal predecessors, (48), 6 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-29 03:09:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:17,984 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2023-11-29 03:09:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 03:09:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 20 states have internal predecessors, (48), 6 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) Word has length 120 [2023-11-29 03:09:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:17,986 INFO L225 Difference]: With dead ends: 191 [2023-11-29 03:09:17,986 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 03:09:17,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=295, Invalid=3611, Unknown=0, NotChecked=0, Total=3906 [2023-11-29 03:09:17,990 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 122 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:17,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 871 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 03:09:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 03:09:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 123. [2023-11-29 03:09:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-29 03:09:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2023-11-29 03:09:18,008 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 120 [2023-11-29 03:09:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:18,009 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2023-11-29 03:09:18,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 20 states have internal predecessors, (48), 6 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) [2023-11-29 03:09:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2023-11-29 03:09:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 03:09:18,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:18,011 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1] [2023-11-29 03:09:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:09:18,012 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:18,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -58314547, now seen corresponding path program 1 times [2023-11-29 03:09:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169731130] [2023-11-29 03:09:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:09:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:09:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:09:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:09:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:09:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:09:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:09:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:09:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 03:09:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-29 03:09:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169731130] [2023-11-29 03:09:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169731130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466667955] [2023-11-29 03:09:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:18,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:18,830 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 4 states have internal predecessors, (48), 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-29 03:09:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:19,749 INFO L93 Difference]: Finished difference Result 170 states and 205 transitions. [2023-11-29 03:09:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:09:19,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 4 states have internal predecessors, (48), 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 121 [2023-11-29 03:09:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:19,751 INFO L225 Difference]: With dead ends: 170 [2023-11-29 03:09:19,751 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 03:09:19,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:09:19,752 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 87 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:19,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 191 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:09:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 03:09:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-29 03:09:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 74 states have internal predecessors, (80), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-29 03:09:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2023-11-29 03:09:19,769 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 121 [2023-11-29 03:09:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:19,769 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2023-11-29 03:09:19,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 4 states have internal predecessors, (48), 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-29 03:09:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2023-11-29 03:09:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 03:09:19,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:19,772 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1] [2023-11-29 03:09:19,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:09:19,772 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:19,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1633539631, now seen corresponding path program 1 times [2023-11-29 03:09:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678138272] [2023-11-29 03:09:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:09:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:09:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:09:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:09:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:09:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:09:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:09:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:28,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:28,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:09:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 03:09:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:09:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:30,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678138272] [2023-11-29 03:09:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678138272] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:09:30,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135986086] [2023-11-29 03:09:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:09:30,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:09:30,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:09:30,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:09:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:31,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 2930 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 03:09:31,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:32,513 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-29 03:09:33,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:09:33,302 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-29 03:09:33,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 74 [2023-11-29 03:09:33,369 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 38 treesize of output 24 [2023-11-29 03:09:33,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:09:33,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-11-29 03:09:33,435 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 85 treesize of output 61 [2023-11-29 03:09:33,471 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-29 03:09:33,472 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 61 treesize of output 93 [2023-11-29 03:09:35,158 INFO L349 Elim1Store]: treesize reduction 93, result has 11.4 percent of original size [2023-11-29 03:09:35,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 162 treesize of output 107 [2023-11-29 03:09:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 03:09:35,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135986086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:09:38,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:09:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 68 [2023-11-29 03:09:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983335530] [2023-11-29 03:09:38,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:38,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-29 03:09:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:38,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-29 03:09:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=5642, Unknown=0, NotChecked=0, Total=5852 [2023-11-29 03:09:38,461 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 68 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 15 states have call successors, (45), 10 states have call predecessors, (45), 17 states have return successors, (42), 19 states have call predecessors, (42), 14 states have call successors, (42) [2023-11-29 03:09:58,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:10:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:10:09,948 INFO L93 Difference]: Finished difference Result 211 states and 258 transitions. [2023-11-29 03:10:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-29 03:10:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 15 states have call successors, (45), 10 states have call predecessors, (45), 17 states have return successors, (42), 19 states have call predecessors, (42), 14 states have call successors, (42) Word has length 122 [2023-11-29 03:10:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:10:09,951 INFO L225 Difference]: With dead ends: 211 [2023-11-29 03:10:09,951 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 03:10:09,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4054 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=1130, Invalid=19176, Unknown=0, NotChecked=0, Total=20306 [2023-11-29 03:10:09,959 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 439 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 7359 mSolverCounterSat, 432 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 7803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 7359 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:10:09,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1677 Invalid, 7803 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [432 Valid, 7359 Invalid, 12 Unknown, 0 Unchecked, 19.0s Time] [2023-11-29 03:10:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 03:10:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 176. [2023-11-29 03:10:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 105 states have (on average 1.161904761904762) internal successors, (122), 110 states have internal predecessors, (122), 44 states have call successors, (44), 21 states have call predecessors, (44), 26 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-29 03:10:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2023-11-29 03:10:09,998 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 122 [2023-11-29 03:10:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:10:09,998 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2023-11-29 03:10:09,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 15 states have call successors, (45), 10 states have call predecessors, (45), 17 states have return successors, (42), 19 states have call predecessors, (42), 14 states have call successors, (42) [2023-11-29 03:10:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2023-11-29 03:10:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 03:10:10,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:10:10,001 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1] [2023-11-29 03:10:10,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:10:10,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:10:10,202 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:10:10,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:10:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash 409607631, now seen corresponding path program 2 times [2023-11-29 03:10:10,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:10:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276176243] [2023-11-29 03:10:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:10:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:10:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:10:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:10:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:10:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:10:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:10:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:10:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:10:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:10:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:10:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:10:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:10:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:10:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:10:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:10:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:10:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:10:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:10:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276176243] [2023-11-29 03:10:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276176243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:10:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732742398] [2023-11-29 03:10:24,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:10:24,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:10:24,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:10:24,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:10:24,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:10:27,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:10:27,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:10:27,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-29 03:10:27,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:10:27,894 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-29 03:10:28,131 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_11| Int)) (and (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse0 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse1 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_11|))) (store (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) |c_#Ultimate.C_memcpy#4_dest.offset| (select .cse0 |c_#Ultimate.C_memcpy#4_dest.offset|)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#4|) (<= 1 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_11|))) is different from true [2023-11-29 03:10:28,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:28,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:28,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:28,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2023-11-29 03:10:28,769 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:10:28,769 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-29 03:10:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 2 not checked. [2023-11-29 03:10:32,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:10:35,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732742398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:10:35,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:10:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 28] total 73 [2023-11-29 03:10:35,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776189218] [2023-11-29 03:10:35,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:10:35,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-29 03:10:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:10:35,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-29 03:10:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=6251, Unknown=5, NotChecked=158, Total=6642 [2023-11-29 03:10:35,875 INFO L87 Difference]: Start difference. First operand 176 states and 213 transitions. Second operand has 73 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:11:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:11:05,492 INFO L93 Difference]: Finished difference Result 365 states and 447 transitions. [2023-11-29 03:11:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-29 03:11:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) Word has length 123 [2023-11-29 03:11:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:11:05,495 INFO L225 Difference]: With dead ends: 365 [2023-11-29 03:11:05,495 INFO L226 Difference]: Without dead ends: 269 [2023-11-29 03:11:05,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1136, Invalid=20915, Unknown=5, NotChecked=294, Total=22350 [2023-11-29 03:11:05,504 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 439 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 7951 mSolverCounterSat, 382 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 8587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 7951 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:11:05,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1158 Invalid, 8587 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [382 Valid, 7951 Invalid, 9 Unknown, 245 Unchecked, 20.7s Time] [2023-11-29 03:11:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-29 03:11:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 167. [2023-11-29 03:11:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 100 states have (on average 1.16) internal successors, (116), 104 states have internal predecessors, (116), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-29 03:11:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2023-11-29 03:11:05,533 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 123 [2023-11-29 03:11:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:11:05,533 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2023-11-29 03:11:05,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:11:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2023-11-29 03:11:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:11:05,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:11:05,535 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:11:05,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:11:05,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:11:05,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:11:05,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:11:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -677336687, now seen corresponding path program 3 times [2023-11-29 03:11:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:11:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664411866] [2023-11-29 03:11:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:11:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:11:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:11:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:11:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:11:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:11:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:11:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:11:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:11:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:11:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:11:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:11:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:11:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:11:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:11:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:11:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:11:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:11:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:11:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:11:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:11:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664411866] [2023-11-29 03:11:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664411866] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:11:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829955062] [2023-11-29 03:11:19,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:11:19,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:11:19,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:11:19,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:11:19,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:11:33,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 03:11:33,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:11:33,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 2852 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-29 03:11:33,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:11:33,986 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-29 03:11:34,233 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_20| Int)) (and (= |c_#memory_int#4| (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse0 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse1 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_20|))) (store (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) |c_#Ultimate.C_memcpy#4_dest.offset| (select .cse0 |c_#Ultimate.C_memcpy#4_dest.offset|)) .cse1 (select .cse0 .cse1))))) (<= 1 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_20|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_20| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|))) is different from true [2023-11-29 03:11:35,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:35,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:35,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:35,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:35,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:35,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:11:35,432 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 59 treesize of output 11 [2023-11-29 03:11:35,568 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:11:35,569 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-29 03:11:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 3 not checked. [2023-11-29 03:11:36,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:11:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829955062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:11:41,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:11:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 29] total 74 [2023-11-29 03:11:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201999808] [2023-11-29 03:11:41,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:11:41,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-29 03:11:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:11:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-29 03:11:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=6412, Unknown=3, NotChecked=160, Total=6806 [2023-11-29 03:11:41,581 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 74 states, 55 states have (on average 1.8) internal successors, (99), 54 states have internal predecessors, (99), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:12:10,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:12:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:20,497 INFO L93 Difference]: Finished difference Result 309 states and 379 transitions. [2023-11-29 03:12:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-29 03:12:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 55 states have (on average 1.8) internal successors, (99), 54 states have internal predecessors, (99), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) Word has length 124 [2023-11-29 03:12:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:20,500 INFO L225 Difference]: With dead ends: 309 [2023-11-29 03:12:20,500 INFO L226 Difference]: Without dead ends: 262 [2023-11-29 03:12:20,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4163 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=1008, Invalid=19584, Unknown=4, NotChecked=284, Total=20880 [2023-11-29 03:12:20,502 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 403 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 8625 mSolverCounterSat, 326 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 9202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 8625 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:20,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1656 Invalid, 9202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [326 Valid, 8625 Invalid, 13 Unknown, 238 Unchecked, 28.1s Time] [2023-11-29 03:12:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-29 03:12:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 168. [2023-11-29 03:12:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 105 states have internal predecessors, (118), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-29 03:12:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2023-11-29 03:12:20,535 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 124 [2023-11-29 03:12:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:20,535 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2023-11-29 03:12:20,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 55 states have (on average 1.8) internal successors, (99), 54 states have internal predecessors, (99), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:12:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2023-11-29 03:12:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:12:20,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:20,537 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:12:20,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:12:20,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 03:12:20,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:20,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash -12872177, now seen corresponding path program 4 times [2023-11-29 03:12:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:12:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057954724] [2023-11-29 03:12:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:12:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:12:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:12:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:12:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:12:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:12:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:12:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:12:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:12:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:30,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:12:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:12:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:12:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:12:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:12:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:12:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 03:12:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:12:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:12:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057954724] [2023-11-29 03:12:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057954724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:12:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351939267] [2023-11-29 03:12:34,141 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:12:34,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:12:34,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:12:34,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:12:34,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:12:37,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:12:37,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:12:37,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 3323 conjuncts, 152 conjunts are in the unsatisfiable core [2023-11-29 03:12:37,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:38,637 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-29 03:12:38,879 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_19 Int) (v_z_19 Int)) (let ((.cse0 (* 18446744073709551616 v_y_19))) (and (<= (+ .cse0 v_z_19 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|) (= |c_#memory_int#4| (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (+ .cse0 v_z_19 |c_#Ultimate.C_memcpy#4_dest.offset|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse1 (select (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|) .cse1))))) (<= (+ v_z_19 1) (mod |c_#Ultimate.C_memcpy#4_size| 18446744073709551616)) (<= 0 (+ .cse0 v_z_19)) (<= 0 v_z_19)))) is different from true [2023-11-29 03:12:38,914 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_31| Int) (v_y_19 Int) (v_z_19 Int)) (let ((.cse2 (* 18446744073709551616 v_y_19))) (and (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse3 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31|))) (store (let ((.cse0 (+ .cse2 v_z_19 |c_#Ultimate.C_memcpy#4_dest.offset|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select .cse1 .cse0))) .cse3 (select .cse1 .cse3)))) |c_#memory_int#4|) (<= (+ v_z_19 1) (mod |c_#Ultimate.C_memcpy#4_size| 18446744073709551616)) (<= 0 (+ .cse2 v_z_19)) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|) (<= 0 v_z_19) (<= (+ .cse2 v_z_19 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31|)))) is different from true [2023-11-29 03:12:38,968 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_31| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_32| Int) (v_y_19 Int) (v_z_19 Int)) (let ((.cse2 (* 18446744073709551616 v_y_19))) (and (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_32|) (<= (+ v_z_19 1) (mod |c_#Ultimate.C_memcpy#4_size| 18446744073709551616)) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse4 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_32|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31|))) (store (let ((.cse0 (+ .cse2 v_z_19 |c_#Ultimate.C_memcpy#4_dest.offset|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select .cse1 .cse0))) .cse3 (select .cse1 .cse3))) .cse4 (select .cse1 .cse4)))) |c_#memory_int#4|) (<= 0 (+ .cse2 v_z_19)) (<= 0 v_z_19) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_32| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|) (<= (+ .cse2 v_z_19 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31|)))) is different from true [2023-11-29 03:12:39,067 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_31| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_32| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_33| Int) (v_y_19 Int) (v_z_19 Int)) (let ((.cse2 (* 18446744073709551616 v_y_19))) (and (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_32|) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse5 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_33|))) (store (let ((.cse4 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_32|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31|))) (store (let ((.cse0 (+ .cse2 v_z_19 |c_#Ultimate.C_memcpy#4_dest.offset|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select .cse1 .cse0))) .cse3 (select .cse1 .cse3))) .cse4 (select .cse1 .cse4))) .cse5 (select .cse1 .cse5)))) |c_#memory_int#4|) (<= (+ v_z_19 1) (mod |c_#Ultimate.C_memcpy#4_size| 18446744073709551616)) (<= 0 (+ .cse2 v_z_19)) (<= 0 v_z_19) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_32| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_33|) (<= (+ .cse2 v_z_19 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_31|)))) is different from true [2023-11-29 03:12:40,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:41,150 INFO L349 Elim1Store]: treesize reduction 702, result has 15.2 percent of original size [2023-11-29 03:12:41,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 185 treesize of output 229 [2023-11-29 03:12:41,393 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 72 treesize of output 54 [2023-11-29 03:12:41,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:41,410 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2023-11-29 03:12:41,410 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 38 [2023-11-29 03:12:41,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:41,645 INFO L349 Elim1Store]: treesize reduction 139, result has 0.7 percent of original size [2023-11-29 03:12:41,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 73 treesize of output 50 [2023-11-29 03:12:41,797 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:12:41,797 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-29 03:12:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 125 trivial. 10 not checked. [2023-11-29 03:12:43,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:12:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351939267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:12:51,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:12:51,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 43] total 89 [2023-11-29 03:12:51,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671278205] [2023-11-29 03:12:51,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:12:51,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-11-29 03:12:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:12:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-11-29 03:12:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=8489, Unknown=4, NotChecked=748, Total=9506 [2023-11-29 03:12:51,369 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand has 89 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 65 states have internal predecessors, (106), 22 states have call successors, (45), 10 states have call predecessors, (45), 18 states have return successors, (42), 27 states have call predecessors, (42), 21 states have call successors, (42) [2023-11-29 03:13:23,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:13:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:13:49,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:14:01,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:14:09,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:14:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:43,035 INFO L93 Difference]: Finished difference Result 365 states and 447 transitions. [2023-11-29 03:14:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-11-29 03:14:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 65 states have internal predecessors, (106), 22 states have call successors, (45), 10 states have call predecessors, (45), 18 states have return successors, (42), 27 states have call predecessors, (42), 21 states have call successors, (42) Word has length 125 [2023-11-29 03:14:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:43,038 INFO L225 Difference]: With dead ends: 365 [2023-11-29 03:14:43,038 INFO L226 Difference]: Without dead ends: 318 [2023-11-29 03:14:43,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6996 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=1454, Invalid=31133, Unknown=9, NotChecked=1444, Total=34040 [2023-11-29 03:14:43,041 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 395 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 11801 mSolverCounterSat, 307 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 13193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 11801 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1072 IncrementalHoareTripleChecker+Unchecked, 67.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:43,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 2004 Invalid, 13193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [307 Valid, 11801 Invalid, 13 Unknown, 1072 Unchecked, 67.5s Time] [2023-11-29 03:14:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-29 03:14:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2023-11-29 03:14:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 106 states have internal predecessors, (120), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-29 03:14:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2023-11-29 03:14:43,080 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 125 [2023-11-29 03:14:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:43,080 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2023-11-29 03:14:43,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 65 states have internal predecessors, (106), 22 states have call successors, (45), 10 states have call predecessors, (45), 18 states have return successors, (42), 27 states have call predecessors, (42), 21 states have call successors, (42) [2023-11-29 03:14:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2023-11-29 03:14:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 03:14:43,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:43,081 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:43,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:14:43,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 03:14:43,282 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:14:43,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash -889308847, now seen corresponding path program 5 times [2023-11-29 03:14:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:14:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097530227] [2023-11-29 03:14:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:14:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:14:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:14:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:14:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:14:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:14:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:14:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:14:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:14:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:14:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:14:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:14:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:14:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:14:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:14:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:14:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:14:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 03:14:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:14:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:14:57,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:14:57,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097530227] [2023-11-29 03:14:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097530227] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:57,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96000445] [2023-11-29 03:14:57,376 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:14:57,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:14:57,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:14:57,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:14:57,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:15:29,880 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-29 03:15:29,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:15:29,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 3454 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-29 03:15:29,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:30,007 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-29 03:15:30,209 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| Int)) (and (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse0 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0)))) |c_#memory_int#4|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) is different from true [2023-11-29 03:15:30,228 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse2 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2)))) |c_#memory_int#4|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) is different from true [2023-11-29 03:15:30,278 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_51| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse3 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51|))) (store (let ((.cse2 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3)))) |c_#memory_int#4|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51|) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|))) is different from true [2023-11-29 03:15:30,430 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_y_24 Int) (v_z_24 Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_51| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| Int)) (let ((.cse5 (* 18446744073709551616 v_y_24))) (and (<= (+ v_z_24 1) (mod |c_#Ultimate.C_memcpy#4_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|) (<= 0 v_z_24) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse1 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse4 (+ .cse5 v_z_24 |c_#Ultimate.C_memcpy#4_dest.offset|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51|))) (store (let ((.cse2 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) .cse4 (select .cse1 .cse4)))) |c_#memory_int#4|) (<= (+ .cse5 v_z_24 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51| 1) (+ .cse5 v_z_24)) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|)))) is different from true [2023-11-29 03:15:30,660 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_53| Int) (v_y_24 Int) (v_z_24 Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_51| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| Int)) (let ((.cse0 (* 18446744073709551616 v_y_24))) (and (<= (+ v_z_24 1) (mod |c_#Ultimate.C_memcpy#4_size| 18446744073709551616)) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|) (<= 0 v_z_24) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51|) (<= (+ .cse0 v_z_24 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1332_53|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51| 1) (+ .cse0 v_z_24)) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse2 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse6 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_53|))) (store (let ((.cse5 (+ .cse0 v_z_24 |c_#Ultimate.C_memcpy#4_dest.offset|))) (store (let ((.cse4 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_51|))) (store (let ((.cse3 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_50|))) (store (let ((.cse1 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_49|))) (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_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#4|)))) is different from true [2023-11-29 03:15:33,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:33,779 INFO L349 Elim1Store]: treesize reduction 1205, result has 12.1 percent of original size [2023-11-29 03:15:33,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 233 treesize of output 287 [2023-11-29 03:15:34,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:34,297 INFO L349 Elim1Store]: treesize reduction 203, result has 0.5 percent of original size [2023-11-29 03:15:34,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 101 treesize of output 68 [2023-11-29 03:15:34,307 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 101 treesize of output 81 [2023-11-29 03:15:34,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:34,323 INFO L349 Elim1Store]: treesize reduction 147, result has 0.7 percent of original size [2023-11-29 03:15:34,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 81 treesize of output 56 [2023-11-29 03:15:34,479 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-11-29 03:15:34,479 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 45 treesize of output 35 [2023-11-29 03:15:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 126 trivial. 15 not checked. [2023-11-29 03:15:35,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96000445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:15:44,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 24] total 63 [2023-11-29 03:15:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527802291] [2023-11-29 03:15:44,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-29 03:15:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-29 03:15:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=4249, Unknown=6, NotChecked=670, Total=5112 [2023-11-29 03:15:44,088 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 63 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 12 states have call successors, (44), 9 states have call predecessors, (44), 11 states have return successors, (41), 13 states have call predecessors, (41), 11 states have call successors, (41) [2023-11-29 03:16:24,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:35,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:44,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:17:10,862 INFO L93 Difference]: Finished difference Result 370 states and 454 transitions. [2023-11-29 03:17:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-29 03:17:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 12 states have call successors, (44), 9 states have call predecessors, (44), 11 states have return successors, (41), 13 states have call predecessors, (41), 11 states have call successors, (41) Word has length 126 [2023-11-29 03:17:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:17:10,865 INFO L225 Difference]: With dead ends: 370 [2023-11-29 03:17:10,865 INFO L226 Difference]: Without dead ends: 323 [2023-11-29 03:17:10,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3686 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=1048, Invalid=17051, Unknown=11, NotChecked=1350, Total=19460 [2023-11-29 03:17:10,868 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 335 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 7974 mSolverCounterSat, 225 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 9485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 7974 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 1275 IncrementalHoareTripleChecker+Unchecked, 55.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:17:10,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 2147 Invalid, 9485 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [225 Valid, 7974 Invalid, 11 Unknown, 1275 Unchecked, 55.9s Time] [2023-11-29 03:17:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-29 03:17:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 170. [2023-11-29 03:17:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 107 states have internal predecessors, (122), 42 states have call successors, (42), 20 states have call predecessors, (42), 24 states have return successors, (44), 42 states have call predecessors, (44), 40 states have call successors, (44) [2023-11-29 03:17:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2023-11-29 03:17:10,912 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 126 [2023-11-29 03:17:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:17:10,912 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2023-11-29 03:17:10,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 12 states have call successors, (44), 9 states have call predecessors, (44), 11 states have return successors, (41), 13 states have call predecessors, (41), 11 states have call successors, (41) [2023-11-29 03:17:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2023-11-29 03:17:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 03:17:10,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:17:10,914 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 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, 1] [2023-11-29 03:17:10,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:17:11,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 03:17:11,114 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:17:11,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:17:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2005925455, now seen corresponding path program 6 times [2023-11-29 03:17:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:17:11,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645935968] [2023-11-29 03:17:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:17:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:17:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:17:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:17:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 03:17:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:17:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:17:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:17:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 03:17:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:17:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:17:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:17:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:17:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:17:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:17:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 03:17:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 03:17:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 03:17:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:17:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645935968] [2023-11-29 03:17:32,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645935968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:17:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885536725] [2023-11-29 03:17:32,856 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 03:17:32,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:17:32,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:17:32,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:17:32,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a2a7379-03c6-42e7-9c24-7597a3c2c37d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:19:21,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-29 03:19:21,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:19:21,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 3559 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-29 03:19:21,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:22,091 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-29 03:19:22,323 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1332_73| Int)) (and (<= 1 |v_#Ultimate.C_memcpy#4_#t~loopctr1332_73|) (= (store |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base| (let ((.cse0 (select |c_#memory_int#4| |c_#Ultimate.C_memcpy#4_dest.base|)) (.cse1 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1332_73|))) (store (store (select |c_old(#memory_int#4)| |c_#Ultimate.C_memcpy#4_dest.base|) |c_#Ultimate.C_memcpy#4_dest.offset| (select .cse0 |c_#Ultimate.C_memcpy#4_dest.offset|)) .cse1 (select .cse0 .cse1)))) |c_#memory_int#4|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1332_73| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1332|))) is different from true [2023-11-29 03:19:46,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:19:46,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 11 [2023-11-29 03:19:46,425 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:19:46,425 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-29 03:19:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 149 trivial. 6 not checked. [2023-11-29 03:19:47,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:19:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885536725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:19:56,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:19:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 32] total 81 [2023-11-29 03:19:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520784518] [2023-11-29 03:19:56,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:19:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-11-29 03:19:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:19:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-11-29 03:19:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=7578, Unknown=8, NotChecked=174, Total=8010 [2023-11-29 03:19:56,007 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 81 states, 61 states have (on average 1.721311475409836) internal successors, (105), 61 states have internal predecessors, (105), 16 states have call successors, (44), 9 states have call predecessors, (44), 15 states have return successors, (41), 21 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:20:18,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:20:27,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:20:40,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:20:45,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:20:59,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:05,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:13,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:18,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:23,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:32,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:21:52,773 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]