./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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 618de5120235c3340e11b4958ef07a29ea7e443f67840fe760124caab804e862 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:05:05,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:05:05,943 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 03:05:05,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:05:05,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:05:05,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:05:05,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:05:05,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:05:05,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:05:05,971 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:05:05,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:05:05,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:05:05,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:05:05,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:05:05,974 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:05:05,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:05:05,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:05:05,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:05:05,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:05:05,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:05:05,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:05:05,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:05:05,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:05:05,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:05:05,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:05:05,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:05:05,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:05:05,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:05:05,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:05:05,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:05:05,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:05:05,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:05:05,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:05:05,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:05:05,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:05:05,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:05:05,985 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:05:05,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:05:05,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:05:05,986 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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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 -> 618de5120235c3340e11b4958ef07a29ea7e443f67840fe760124caab804e862 [2023-11-29 03:05:06,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:05:06,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:05:06,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:05:06,249 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:05:06,249 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:05:06,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i [2023-11-29 03:05:09,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:05:09,418 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:05:09,419 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i [2023-11-29 03:05:09,451 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/data/8c4c0df1d/bf4c3a60cf6c47fd9c129a3a612a69ee/FLAG320715be2 [2023-11-29 03:05:09,465 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/data/8c4c0df1d/bf4c3a60cf6c47fd9c129a3a612a69ee [2023-11-29 03:05:09,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:05:09,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:05:09,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:05:09,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:05:09,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:05:09,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:05:09" (1/1) ... [2023-11-29 03:05:09,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56542bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:09, skipping insertion in model container [2023-11-29 03:05:09,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:05:09" (1/1) ... [2023-11-29 03:05:09,577 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:05:09,822 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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i[4500,4513] [2023-11-29 03:05:09,831 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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i[4560,4573] [2023-11-29 03:05:10,806 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,807 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,808 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,808 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,809 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,820 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:10,822 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,246 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 03:05:11,247 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 03:05:11,248 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 03:05:11,249 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 03:05:11,250 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 03:05:11,250 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 03:05:11,251 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 03:05:11,251 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 03:05:11,252 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 03:05:11,252 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 03:05:11,478 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,479 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:05:11,622 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:05:11,637 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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i[4500,4513] [2023-11-29 03:05:11,637 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_5e4cffb9-27a3-41a9-8f19-6fac07875f82/sv-benchmarks/c/aws-c-common/aws_string_new_from_string_harness.i[4560,4573] [2023-11-29 03:05:11,674 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,674 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,674 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,675 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,676 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,681 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,682 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,683 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,683 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,714 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 03:05:11,715 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 03:05:11,716 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 03:05:11,717 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 03:05:11,718 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 03:05:11,718 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 03:05:11,719 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 03:05:11,719 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 03:05:11,720 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 03:05:11,720 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 03:05:11,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-29 03:05:11,792 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,793 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 03:05:11,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-29 03:05:11,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:05:12,094 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,094 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,094 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,094 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,095 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,096 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,096 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,096 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,096 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,096 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:05:12,102 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:05:12,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12 WrapperNode [2023-11-29 03:05:12,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:05:12,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:05:12,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:05:12,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:05:12,109 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:05:12" (1/1) ... [2023-11-29 03:05:12,198 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:05:12" (1/1) ... [2023-11-29 03:05:12,265 INFO L138 Inliner]: procedures = 689, calls = 2743, calls flagged for inlining = 59, calls inlined = 9, statements flattened = 830 [2023-11-29 03:05:12,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:05:12,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:05:12,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:05:12,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:05:12,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,358 INFO L175 MemorySlicer]: Split 525 memory accesses to 7 slices as follows [2, 256, 236, 5, 21, 2, 3]. 49 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 256, 236, 5, 0, 0, 3]. The 8 writes are split as follows [0, 0, 0, 0, 7, 1, 0]. [2023-11-29 03:05:12,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:05:12,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:05:12,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:05:12,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:05:12,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (1/1) ... [2023-11-29 03:05:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:05:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:05:12,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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:05:12,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/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:05:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-29 03:05:12,509 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-29 03:05:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:05:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-29 03:05:12,510 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#0 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#1 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#2 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#3 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#4 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#5 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real#6 [2023-11-29 03:05:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-29 03:05:12,510 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 03:05:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 03:05:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-29 03:05:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-29 03:05:12,513 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-29 03:05:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-29 03:05:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:05:12,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 03:05:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:05:12,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-29 03:05:12,516 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-29 03:05:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 03:05:12,517 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-29 03:05:12,517 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-29 03:05:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:05:12,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:05:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-29 03:05:12,518 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-29 03:05:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:05:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-29 03:05:12,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-29 03:05:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:05:12,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:05:12,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2023-11-29 03:05:12,520 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-29 03:05:12,520 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-29 03:05:12,520 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-29 03:05:12,520 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 03:05:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#0 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#1 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#2 [2023-11-29 03:05:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#3 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#4 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#5 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real#6 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_string [2023-11-29 03:05:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_string [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:05:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 03:05:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 03:05:12,834 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:05:12,836 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:05:13,617 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2023-11-29 03:05:14,125 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:05:14,232 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:05:14,232 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 03:05:14,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:05:14 BoogieIcfgContainer [2023-11-29 03:05:14,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:05:14,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:05:14,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:05:14,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:05:14,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:05:09" (1/3) ... [2023-11-29 03:05:14,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fea4d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:05:14, skipping insertion in model container [2023-11-29 03:05:14,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:12" (2/3) ... [2023-11-29 03:05:14,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fea4d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:05:14, skipping insertion in model container [2023-11-29 03:05:14,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:05:14" (3/3) ... [2023-11-29 03:05:14,240 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_string_harness.i [2023-11-29 03:05:14,254 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:05:14,254 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:05:14,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:05:14,303 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;@43dd746a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:05:14,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:05:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 75 states have internal predecessors, (92), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-29 03:05:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:05:14,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:14,317 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:14,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:14,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash -801297302, now seen corresponding path program 1 times [2023-11-29 03:05:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346401582] [2023-11-29 03:05:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:05:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:05:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 03:05:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:05:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:05:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 03:05:15,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:15,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346401582] [2023-11-29 03:05:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346401582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:15,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:15,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:05:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090777966] [2023-11-29 03:05:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:15,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:05:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:15,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:05:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:05:15,160 INFO L87 Difference]: Start difference. First operand has 131 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 75 states have internal predecessors, (92), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 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:05:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:15,935 INFO L93 Difference]: Finished difference Result 271 states and 373 transitions. [2023-11-29 03:05:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:05:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 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 70 [2023-11-29 03:05:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:15,951 INFO L225 Difference]: With dead ends: 271 [2023-11-29 03:05:15,951 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 03:05:15,955 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:05:15,959 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 92 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:15,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 171 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:05:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 03:05:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2023-11-29 03:05:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 74 states have internal predecessors, (88), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 03:05:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2023-11-29 03:05:16,020 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 165 transitions. Word has length 70 [2023-11-29 03:05:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:16,021 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 165 transitions. [2023-11-29 03:05:16,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 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:05:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 165 transitions. [2023-11-29 03:05:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:05:16,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:16,025 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:05:16,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:16,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2079812912, now seen corresponding path program 1 times [2023-11-29 03:05:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435278014] [2023-11-29 03:05:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:05:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:05:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 03:05:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:05:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:05:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 03:05:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435278014] [2023-11-29 03:05:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435278014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:05:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637673302] [2023-11-29 03:05:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:17,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:05:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:05:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:05:17,539 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:05:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:18,799 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2023-11-29 03:05:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:05:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 70 [2023-11-29 03:05:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:18,803 INFO L225 Difference]: With dead ends: 214 [2023-11-29 03:05:18,803 INFO L226 Difference]: Without dead ends: 170 [2023-11-29 03:05:18,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:05:18,805 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 109 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:18,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 675 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 03:05:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-29 03:05:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 133. [2023-11-29 03:05:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 39 states have call successors, (39), 16 states have call predecessors, (39), 17 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2023-11-29 03:05:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2023-11-29 03:05:18,832 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 70 [2023-11-29 03:05:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:18,833 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2023-11-29 03:05:18,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:05:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2023-11-29 03:05:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 03:05:18,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:18,837 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:18,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:05:18,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:18,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 300274111, now seen corresponding path program 1 times [2023-11-29 03:05:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346159028] [2023-11-29 03:05:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:05:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:05:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 03:05:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:05:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:05:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 03:05:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346159028] [2023-11-29 03:05:19,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346159028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:05:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414478224] [2023-11-29 03:05:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:19,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:05:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:05:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:05:19,994 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 03:05:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:21,320 INFO L93 Difference]: Finished difference Result 231 states and 309 transitions. [2023-11-29 03:05:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:05:21,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 74 [2023-11-29 03:05:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:21,324 INFO L225 Difference]: With dead ends: 231 [2023-11-29 03:05:21,324 INFO L226 Difference]: Without dead ends: 191 [2023-11-29 03:05:21,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:05:21,326 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 90 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:21,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 576 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:05:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-29 03:05:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2023-11-29 03:05:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 42 states have call successors, (42), 16 states have call predecessors, (42), 18 states have return successors, (43), 41 states have call predecessors, (43), 41 states have call successors, (43) [2023-11-29 03:05:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2023-11-29 03:05:21,354 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 74 [2023-11-29 03:05:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:21,355 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2023-11-29 03:05:21,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 03:05:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2023-11-29 03:05:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 03:05:21,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:21,358 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:21,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:05:21,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:21,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash 428345408, now seen corresponding path program 1 times [2023-11-29 03:05:21,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473709277] [2023-11-29 03:05:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:05:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:05:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 03:05:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:05:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:05:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:05:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:05:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 03:05:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473709277] [2023-11-29 03:05:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473709277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 03:05:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664830456] [2023-11-29 03:05:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:22,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:05:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:05:22,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:05:22,532 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-29 03:05:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:24,569 INFO L93 Difference]: Finished difference Result 222 states and 296 transitions. [2023-11-29 03:05:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:05:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 82 [2023-11-29 03:05:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:24,572 INFO L225 Difference]: With dead ends: 222 [2023-11-29 03:05:24,572 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 03:05:24,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:05:24,575 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 219 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:24,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 786 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 03:05:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 03:05:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2023-11-29 03:05:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 88 states have internal predecessors, (100), 44 states have call successors, (44), 16 states have call predecessors, (44), 19 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2023-11-29 03:05:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2023-11-29 03:05:24,604 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 82 [2023-11-29 03:05:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:24,604 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2023-11-29 03:05:24,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-29 03:05:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2023-11-29 03:05:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 03:05:24,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:24,607 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:24,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:05:24,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:24,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2028446898, now seen corresponding path program 1 times [2023-11-29 03:05:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:24,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724717356] [2023-11-29 03:05:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:05:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:05:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 03:05:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:05:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:05:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:05:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:05:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:05:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 03:05:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724717356] [2023-11-29 03:05:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724717356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:25,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:05:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754907342] [2023-11-29 03:05:25,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:25,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:05:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:05:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:05:25,662 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:26,733 INFO L93 Difference]: Finished difference Result 235 states and 310 transitions. [2023-11-29 03:05:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:05:26,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 1 states have call successors, (15) Word has length 86 [2023-11-29 03:05:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:26,736 INFO L225 Difference]: With dead ends: 235 [2023-11-29 03:05:26,736 INFO L226 Difference]: Without dead ends: 193 [2023-11-29 03:05:26,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:05:26,737 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 169 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:26,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 518 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:05:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-29 03:05:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 156. [2023-11-29 03:05:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 93 states have internal predecessors, (105), 44 states have call successors, (44), 16 states have call predecessors, (44), 22 states have return successors, (52), 46 states have call predecessors, (52), 42 states have call successors, (52) [2023-11-29 03:05:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2023-11-29 03:05:26,760 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 86 [2023-11-29 03:05:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:26,761 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2023-11-29 03:05:26,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2023-11-29 03:05:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 03:05:26,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:26,763 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:26,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:05:26,764 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:26,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1798200008, now seen corresponding path program 1 times [2023-11-29 03:05:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979525440] [2023-11-29 03:05:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:33,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:05:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:05:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 03:05:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:05:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:05:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:05:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:05:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:05:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:05:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:05:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:05:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-29 03:05:34,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979525440] [2023-11-29 03:05:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979525440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:05:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453093220] [2023-11-29 03:05:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:34,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:05:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:05:34,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:05:34,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:05:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:35,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 2709 conjuncts, 135 conjunts are in the unsatisfiable core [2023-11-29 03:05:35,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:05:35,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:05:39,209 INFO L349 Elim1Store]: treesize reduction 168, result has 24.0 percent of original size [2023-11-29 03:05:39,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 220 treesize of output 180 [2023-11-29 03:05:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 03:05:40,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:05:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453093220] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:05:43,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:05:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33] total 51 [2023-11-29 03:05:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816573677] [2023-11-29 03:05:43,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:05:43,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 03:05:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:43,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 03:05:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3478, Unknown=0, NotChecked=0, Total=3660 [2023-11-29 03:05:43,742 INFO L87 Difference]: Start difference. First operand 156 states and 201 transitions. Second operand has 51 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 37 states have internal predecessors, (97), 18 states have call successors, (33), 9 states have call predecessors, (33), 13 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2023-11-29 03:06:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:00,464 INFO L93 Difference]: Finished difference Result 405 states and 528 transitions. [2023-11-29 03:06:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-29 03:06:00,464 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 37 states have internal predecessors, (97), 18 states have call successors, (33), 9 states have call predecessors, (33), 13 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) Word has length 93 [2023-11-29 03:06:00,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:00,467 INFO L225 Difference]: With dead ends: 405 [2023-11-29 03:06:00,468 INFO L226 Difference]: Without dead ends: 267 [2023-11-29 03:06:00,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3669 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1136, Invalid=13626, Unknown=0, NotChecked=0, Total=14762 [2023-11-29 03:06:00,474 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 429 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 6131 mSolverCounterSat, 312 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 6461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 6131 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 2482 Invalid, 6461 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [312 Valid, 6131 Invalid, 18 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 03:06:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-29 03:06:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 186. [2023-11-29 03:06:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 114 states have internal predecessors, (128), 48 states have call successors, (48), 23 states have call predecessors, (48), 28 states have return successors, (57), 48 states have call predecessors, (57), 45 states have call successors, (57) [2023-11-29 03:06:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2023-11-29 03:06:00,511 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 93 [2023-11-29 03:06:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:00,512 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2023-11-29 03:06:00,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 37 states have internal predecessors, (97), 18 states have call successors, (33), 9 states have call predecessors, (33), 13 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2023-11-29 03:06:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2023-11-29 03:06:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 03:06:00,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:00,514 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-11-29 03:06:00,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:06:00,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:06:00,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:00,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 656865724, now seen corresponding path program 1 times [2023-11-29 03:06:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647828408] [2023-11-29 03:06:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 03:06:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 03:06:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:06:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:06:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 03:06:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 03:06:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 03:06:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:06:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 03:06:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647828408] [2023-11-29 03:06:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647828408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:06:01,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924418846] [2023-11-29 03:06:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:01,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:06:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:06:01,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:06:01,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:06:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:02,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 2701 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:06:02,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:06:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 03:06:02,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:06:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924418846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:06:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 20 [2023-11-29 03:06:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680283315] [2023-11-29 03:06:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:06:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:02,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:06:02,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:06:02,408 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 03:06:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:02,598 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2023-11-29 03:06:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:06:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 93 [2023-11-29 03:06:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:02,600 INFO L225 Difference]: With dead ends: 197 [2023-11-29 03:06:02,601 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 03:06:02,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:06:02,602 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 16 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:02,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 839 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:06:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 03:06:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 163. [2023-11-29 03:06:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 96 states have (on average 1.1770833333333333) internal successors, (113), 99 states have internal predecessors, (113), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2023-11-29 03:06:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 200 transitions. [2023-11-29 03:06:02,640 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 200 transitions. Word has length 93 [2023-11-29 03:06:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:02,640 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 200 transitions. [2023-11-29 03:06:02,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 03:06:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 200 transitions. [2023-11-29 03:06:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:06:02,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:02,642 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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:06:02,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:06:02,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:06:02,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:02,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash -298843693, now seen corresponding path program 1 times [2023-11-29 03:06:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223395283] [2023-11-29 03:06:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:06:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:06:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:06:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 03:06:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 03:06:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:06:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 03:06:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 03:06:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 03:06:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223395283] [2023-11-29 03:06:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223395283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:03,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:06:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:06:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741230675] [2023-11-29 03:06:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:03,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:06:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:06:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:06:03,607 INFO L87 Difference]: Start difference. First operand 163 states and 200 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 03:06:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:04,790 INFO L93 Difference]: Finished difference Result 295 states and 366 transitions. [2023-11-29 03:06:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:06:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 111 [2023-11-29 03:06:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:04,792 INFO L225 Difference]: With dead ends: 295 [2023-11-29 03:06:04,792 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 03:06:04,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:06:04,793 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 191 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:04,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 513 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:06:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 03:06:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 159. [2023-11-29 03:06:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 96 states have internal predecessors, (109), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2023-11-29 03:06:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2023-11-29 03:06:04,820 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 194 transitions. Word has length 111 [2023-11-29 03:06:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:04,821 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 194 transitions. [2023-11-29 03:06:04,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 03:06:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2023-11-29 03:06:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 03:06:04,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:04,823 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1] [2023-11-29 03:06:04,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:06:04,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:04,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1266268980, now seen corresponding path program 1 times [2023-11-29 03:06:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102267449] [2023-11-29 03:06:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:06:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:06:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:06:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:06:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:06:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:06:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:06:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 03:06:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 03:06:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 03:06:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102267449] [2023-11-29 03:06:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102267449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:05,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:06:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:06:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105997708] [2023-11-29 03:06:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:05,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:06:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:06:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:06:05,401 INFO L87 Difference]: Start difference. First operand 159 states and 194 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (23), 6 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 03:06:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:06,493 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2023-11-29 03:06:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:06:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (23), 6 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 119 [2023-11-29 03:06:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:06,495 INFO L225 Difference]: With dead ends: 233 [2023-11-29 03:06:06,495 INFO L226 Difference]: Without dead ends: 172 [2023-11-29 03:06:06,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:06:06,496 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 155 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:06,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 383 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:06:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-29 03:06:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2023-11-29 03:06:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 42 states have call successors, (42), 21 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:06:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2023-11-29 03:06:06,524 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 119 [2023-11-29 03:06:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:06,525 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2023-11-29 03:06:06,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (23), 6 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 03:06:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2023-11-29 03:06:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 03:06:06,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:06,526 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 03:06:06,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:06:06,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:06,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1888457216, now seen corresponding path program 1 times [2023-11-29 03:06:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165102457] [2023-11-29 03:06:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:06:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:06:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:06:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:06:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:06:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:06:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:06:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:06:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:06:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:06:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 03:06:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165102457] [2023-11-29 03:06:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165102457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:06:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092289456] [2023-11-29 03:06:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:07,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:06:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:06:07,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:06:07,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:06:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:07,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 2869 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:06:07,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:06:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 03:06:08,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:06:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092289456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:06:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2023-11-29 03:06:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506629104] [2023-11-29 03:06:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:08,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:06:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:06:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:06:08,178 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 03:06:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:08,457 INFO L93 Difference]: Finished difference Result 253 states and 301 transitions. [2023-11-29 03:06:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:06:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 123 [2023-11-29 03:06:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:08,459 INFO L225 Difference]: With dead ends: 253 [2023-11-29 03:06:08,459 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 03:06:08,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2023-11-29 03:06:08,460 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 38 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:08,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1264 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:06:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 03:06:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2023-11-29 03:06:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 95 states have internal predecessors, (108), 40 states have call successors, (40), 21 states have call predecessors, (40), 23 states have return successors, (42), 40 states have call predecessors, (42), 39 states have call successors, (42) [2023-11-29 03:06:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2023-11-29 03:06:08,483 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 123 [2023-11-29 03:06:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:08,483 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2023-11-29 03:06:08,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 03:06:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2023-11-29 03:06:08,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 03:06:08,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:08,484 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:06:08,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 03:06:08,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:06:08,685 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:08,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1411816382, now seen corresponding path program 1 times [2023-11-29 03:06:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130351478] [2023-11-29 03:06:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:06:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:06:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:06:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:06:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:06:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:06:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:06:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:06:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:06:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:06:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 03:06:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130351478] [2023-11-29 03:06:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130351478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:09,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:06:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:06:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128534029] [2023-11-29 03:06:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:06:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:06:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:06:09,358 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 03:06:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:10,439 INFO L93 Difference]: Finished difference Result 241 states and 301 transitions. [2023-11-29 03:06:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:06:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 123 [2023-11-29 03:06:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:10,441 INFO L225 Difference]: With dead ends: 241 [2023-11-29 03:06:10,441 INFO L226 Difference]: Without dead ends: 170 [2023-11-29 03:06:10,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:06:10,442 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 265 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:10,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 442 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:06:10,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-29 03:06:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2023-11-29 03:06:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 89 states have (on average 1.146067415730337) internal successors, (102), 91 states have internal predecessors, (102), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2023-11-29 03:06:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2023-11-29 03:06:10,464 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 123 [2023-11-29 03:06:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:10,465 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2023-11-29 03:06:10,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 03:06:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2023-11-29 03:06:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-29 03:06:10,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:10,466 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:06:10,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:06:10,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:10,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash -102545533, now seen corresponding path program 1 times [2023-11-29 03:06:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311034697] [2023-11-29 03:06:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:10,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:10,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:06:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:06:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:06:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:06:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:06:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:06:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:06:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:06:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 03:06:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 03:06:11,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311034697] [2023-11-29 03:06:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311034697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:11,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:06:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 03:06:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670148490] [2023-11-29 03:06:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:06:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:06:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:06:11,333 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand has 19 states, 16 states have (on average 3.6875) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 03:06:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:13,036 INFO L93 Difference]: Finished difference Result 206 states and 250 transitions. [2023-11-29 03:06:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:06:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.6875) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2023-11-29 03:06:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:13,038 INFO L225 Difference]: With dead ends: 206 [2023-11-29 03:06:13,038 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 03:06:13,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 03:06:13,040 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 110 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:13,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 882 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:06:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 03:06:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2023-11-29 03:06:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 89 states have (on average 1.146067415730337) internal successors, (102), 91 states have internal predecessors, (102), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (39), 38 states have call predecessors, (39), 38 states have call successors, (39) [2023-11-29 03:06:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 180 transitions. [2023-11-29 03:06:13,071 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 180 transitions. Word has length 129 [2023-11-29 03:06:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:13,072 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 180 transitions. [2023-11-29 03:06:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.6875) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (21), 6 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 03:06:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 180 transitions. [2023-11-29 03:06:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-29 03:06:13,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:06:13,074 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:06:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:06:13,074 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:06:13,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:06:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1877552895, now seen corresponding path program 1 times [2023-11-29 03:06:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:06:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883132918] [2023-11-29 03:06:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:06:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:06:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:06:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:06:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:06:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:06:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:06:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:06:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:06:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:06:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:06:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:06:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:06:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 03:06:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-29 03:06:14,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883132918] [2023-11-29 03:06:14,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883132918] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:06:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144031287] [2023-11-29 03:06:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:06:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:06:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:06:14,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:06:14,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:06:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:15,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 218 conjunts are in the unsatisfiable core [2023-11-29 03:06:15,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:06:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-11-29 03:06:15,711 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-11-29 03:06:15,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 113 [2023-11-29 03:06:15,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-11-29 03:06:15,755 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:06:15,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 92 [2023-11-29 03:06:15,797 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-29 03:06:15,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 28 [2023-11-29 03:06:15,927 INFO L349 Elim1Store]: treesize reduction 73, result has 1.4 percent of original size [2023-11-29 03:06:15,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 56 [2023-11-29 03:06:16,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 211 [2023-11-29 03:06:16,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:06:16,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 186 [2023-11-29 03:06:16,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:06:19,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 128 [2023-11-29 03:06:19,704 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2023-11-29 03:06:19,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 131 [2023-11-29 03:06:22,449 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:06:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 32 proven. 33 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 03:06:22,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:22,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 131 [2023-11-29 03:07:22,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2023-11-29 03:07:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-11-29 03:07:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144031287] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:07:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:07:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13, 40] total 64 [2023-11-29 03:07:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103522942] [2023-11-29 03:07:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:07:23,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:07:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:07:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:07:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3826, Unknown=8, NotChecked=0, Total=4032 [2023-11-29 03:07:23,266 INFO L87 Difference]: Start difference. First operand 151 states and 180 transitions. Second operand has 14 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 03:07:30,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:35,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:39,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:43,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:47,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:51,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:55,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:07:59,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:03,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:07,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:11,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:15,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:19,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:23,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:27,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:31,513 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 [1] [2023-11-29 03:08:35,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:39,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:43,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:47,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:51,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:55,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:08:59,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:09:05,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:09:09,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:09:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:09,975 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2023-11-29 03:09:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:09:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2023-11-29 03:09:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:09,977 INFO L225 Difference]: With dead ends: 170 [2023-11-29 03:09:09,977 INFO L226 Difference]: Without dead ends: 168 [2023-11-29 03:09:09,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=241, Invalid=4863, Unknown=8, NotChecked=0, Total=5112 [2023-11-29 03:09:09,979 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 72 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 54 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:09,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 473 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 945 Invalid, 25 Unknown, 0 Unchecked, 104.6s Time] [2023-11-29 03:09:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-29 03:09:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2023-11-29 03:09:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 98 states have internal predecessors, (110), 41 states have call successors, (41), 22 states have call predecessors, (41), 24 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2023-11-29 03:09:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 193 transitions. [2023-11-29 03:09:10,060 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 193 transitions. Word has length 129 [2023-11-29 03:09:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:10,061 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 193 transitions. [2023-11-29 03:09:10,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 03:09:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 193 transitions. [2023-11-29 03:09:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 03:09:10,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:10,062 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:10,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:09:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:09:10,262 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:10,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1490334063, now seen corresponding path program 1 times [2023-11-29 03:09:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081803760] [2023-11-29 03:09:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:09:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:09:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:09:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:09:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:09:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:09:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:09:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:09:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:09:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:09:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 03:09:10,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081803760] [2023-11-29 03:09:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081803760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:10,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:10,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999100695] [2023-11-29 03:09:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:10,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:10,851 INFO L87 Difference]: Start difference. First operand 161 states and 193 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 03:09:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:11,745 INFO L93 Difference]: Finished difference Result 215 states and 261 transitions. [2023-11-29 03:09:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:09:11,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2023-11-29 03:09:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:11,747 INFO L225 Difference]: With dead ends: 215 [2023-11-29 03:09:11,747 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 03:09:11,747 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:11,748 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 137 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:11,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 193 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:09:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 03:09:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-29 03:09:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 96 states have (on average 1.15625) internal successors, (111), 99 states have internal predecessors, (111), 41 states have call successors, (41), 22 states have call predecessors, (41), 24 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2023-11-29 03:09:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2023-11-29 03:09:11,830 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 130 [2023-11-29 03:09:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:11,831 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2023-11-29 03:09:11,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 03:09:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2023-11-29 03:09:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 03:09:11,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:11,832 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:11,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:09:11,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:11,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2090461647, now seen corresponding path program 1 times [2023-11-29 03:09:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040079861] [2023-11-29 03:09:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:09:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:09:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:09:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:09:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:09:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:09:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:09:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:09:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:09:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:09:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 03:09:12,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040079861] [2023-11-29 03:09:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040079861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:12,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240521098] [2023-11-29 03:09:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:12,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:12,436 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 03:09:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:13,343 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2023-11-29 03:09:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:09:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2023-11-29 03:09:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:13,345 INFO L225 Difference]: With dead ends: 216 [2023-11-29 03:09:13,345 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 03:09:13,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:09:13,346 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:13,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 284 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:09:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 03:09:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-29 03:09:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 99 states have internal predecessors, (110), 41 states have call successors, (41), 22 states have call predecessors, (41), 24 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2023-11-29 03:09:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2023-11-29 03:09:13,429 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 130 [2023-11-29 03:09:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:13,429 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2023-11-29 03:09:13,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 6 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 03:09:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2023-11-29 03:09:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 03:09:13,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:13,430 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:13,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:09:13,430 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:13,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -765181053, now seen corresponding path program 1 times [2023-11-29 03:09:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627805098] [2023-11-29 03:09:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:09:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:09:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 03:09:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 03:09:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:09:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 03:09:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 03:09:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:09:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:09:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:09:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:09:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 03:09:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:09:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-29 03:09:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627805098] [2023-11-29 03:09:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627805098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:09:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093393423] [2023-11-29 03:09:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:16,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:09:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:09:16,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:09:16,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:09:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:17,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 3048 conjuncts, 153 conjunts are in the unsatisfiable core [2023-11-29 03:09:17,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:17,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-11-29 03:09:17,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 03:09:17,135 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:09:17,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 03:09:17,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:09:17,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 03:09:19,097 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 03:09:19,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 71 [2023-11-29 03:09:20,202 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:20,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:09:20,834 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-29 03:09:20,835 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:20,870 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 42 treesize of output 28 [2023-11-29 03:09:20,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:09:20,880 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:09:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 03:09:21,084 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 131 treesize of output 97 [2023-11-29 03:09:21,108 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-29 03:09:21,109 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 97 treesize of output 119 [2023-11-29 03:09:21,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:09:21,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 3 [2023-11-29 03:09:23,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:09:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 524 treesize of output 488 [2023-11-29 03:09:24,357 INFO L349 Elim1Store]: treesize reduction 68, result has 53.1 percent of original size [2023-11-29 03:09:24,358 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 8 new quantified variables, introduced 14 case distinctions, treesize of input 539 treesize of output 529 [2023-11-29 03:09:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 03:09:24,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093393423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:09:28,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:09:28,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 40] total 63 [2023-11-29 03:09:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399356509] [2023-11-29 03:09:28,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:28,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-29 03:09:28,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-29 03:09:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=4929, Unknown=0, NotChecked=0, Total=5112 [2023-11-29 03:09:28,563 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 63 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 43 states have internal predecessors, (115), 20 states have call successors, (46), 14 states have call predecessors, (46), 13 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2023-11-29 03:09:34,978 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:09:37,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:10:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:10:11,035 INFO L93 Difference]: Finished difference Result 322 states and 395 transitions. [2023-11-29 03:10:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 03:10:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 43 states have internal predecessors, (115), 20 states have call successors, (46), 14 states have call predecessors, (46), 13 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) Word has length 131 [2023-11-29 03:10:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:10:11,038 INFO L225 Difference]: With dead ends: 322 [2023-11-29 03:10:11,038 INFO L226 Difference]: Without dead ends: 235 [2023-11-29 03:10:11,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3691 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=949, Invalid=17957, Unknown=0, NotChecked=0, Total=18906 [2023-11-29 03:10:11,048 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 301 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 8462 mSolverCounterSat, 246 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 8768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 8462 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:10:11,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 3185 Invalid, 8768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [246 Valid, 8462 Invalid, 60 Unknown, 0 Unchecked, 28.5s Time] [2023-11-29 03:10:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-29 03:10:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2023-11-29 03:10:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.164179104477612) internal successors, (156), 139 states have internal predecessors, (156), 54 states have call successors, (54), 27 states have call predecessors, (54), 33 states have return successors, (58), 55 states have call predecessors, (58), 52 states have call successors, (58) [2023-11-29 03:10:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2023-11-29 03:10:11,194 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 131 [2023-11-29 03:10:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:10:11,194 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2023-11-29 03:10:11,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 43 states have internal predecessors, (115), 20 states have call successors, (46), 14 states have call predecessors, (46), 13 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2023-11-29 03:10:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2023-11-29 03:10:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 03:10:11,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:10:11,195 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:10:11,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:10:11,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:10:11,396 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:10:11,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:10:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 646442740, now seen corresponding path program 1 times [2023-11-29 03:10:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:10:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109433975] [2023-11-29 03:10:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:10:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:10:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:10:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:10:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:10:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:10:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:10:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:10:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:10:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 03:10:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:10:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 03:10:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:10:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:10:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:10:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:10:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:10:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 03:10:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:10:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 03:10:22,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:10:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109433975] [2023-11-29 03:10:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109433975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:10:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640911143] [2023-11-29 03:10:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:10:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:10:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:10:22,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:10:22,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:10:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:10:23,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 162 conjunts are in the unsatisfiable core [2023-11-29 03:10:23,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:10:23,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-11-29 03:10:23,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:23,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 03:10:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:23,530 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:10:23,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 03:10:23,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 03:10:26,183 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 03:10:26,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 71 [2023-11-29 03:10:27,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:10:29,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:30,012 INFO L349 Elim1Store]: treesize reduction 222, result has 25.0 percent of original size [2023-11-29 03:10:30,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 175 [2023-11-29 03:10:30,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:30,309 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-29 03:10:30,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 43 [2023-11-29 03:10:30,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:30,372 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-29 03:10:30,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 43 [2023-11-29 03:10:30,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2023-11-29 03:10:30,424 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-29 03:10:30,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:10:30,439 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 03:10:30,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 03:10:30,667 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 131 treesize of output 97 [2023-11-29 03:10:30,694 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-29 03:10:30,695 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 97 treesize of output 119 [2023-11-29 03:10:30,735 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:10:30,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 3 [2023-11-29 03:10:33,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:10:33,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 536 treesize of output 496 [2023-11-29 03:10:34,427 INFO L349 Elim1Store]: treesize reduction 68, result has 53.1 percent of original size [2023-11-29 03:10:34,428 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 8 new quantified variables, introduced 14 case distinctions, treesize of input 986 treesize of output 924 [2023-11-29 03:10:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 17 proven. 40 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:10:34,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:10:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640911143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:10:40,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:10:40,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 41] total 80 [2023-11-29 03:10:40,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992031160] [2023-11-29 03:10:40,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:10:40,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-29 03:10:40,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:10:40,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-29 03:10:40,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=7580, Unknown=4, NotChecked=0, Total=7832 [2023-11-29 03:10:40,812 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 80 states, 60 states have (on average 2.0166666666666666) internal successors, (121), 57 states have internal predecessors, (121), 19 states have call successors, (46), 13 states have call predecessors, (46), 17 states have return successors, (41), 22 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:10:44,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:10:48,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:11:18,017 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:11:29,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:11:34,787 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:12:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:12:03,845 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2023-11-29 03:12:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-29 03:12:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 60 states have (on average 2.0166666666666666) internal successors, (121), 57 states have internal predecessors, (121), 19 states have call successors, (46), 13 states have call predecessors, (46), 17 states have return successors, (41), 22 states have call predecessors, (41), 15 states have call successors, (41) Word has length 136 [2023-11-29 03:12:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:12:03,848 INFO L225 Difference]: With dead ends: 310 [2023-11-29 03:12:03,848 INFO L226 Difference]: Without dead ends: 308 [2023-11-29 03:12:03,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4040 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=1105, Invalid=22451, Unknown=6, NotChecked=0, Total=23562 [2023-11-29 03:12:03,852 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 545 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 10074 mSolverCounterSat, 458 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 10579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 10074 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:12:03,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3293 Invalid, 10579 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [458 Valid, 10074 Invalid, 47 Unknown, 0 Unchecked, 48.8s Time] [2023-11-29 03:12:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-29 03:12:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 225. [2023-11-29 03:12:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 137 states have (on average 1.1751824817518248) internal successors, (161), 142 states have internal predecessors, (161), 54 states have call successors, (54), 27 states have call predecessors, (54), 33 states have return successors, (58), 55 states have call predecessors, (58), 52 states have call successors, (58) [2023-11-29 03:12:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 273 transitions. [2023-11-29 03:12:04,001 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 273 transitions. Word has length 136 [2023-11-29 03:12:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:12:04,002 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 273 transitions. [2023-11-29 03:12:04,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 60 states have (on average 2.0166666666666666) internal successors, (121), 57 states have internal predecessors, (121), 19 states have call successors, (46), 13 states have call predecessors, (46), 17 states have return successors, (41), 22 states have call predecessors, (41), 15 states have call successors, (41) [2023-11-29 03:12:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 273 transitions. [2023-11-29 03:12:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 03:12:04,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:12:04,003 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 03:12:04,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 03:12:04,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:12:04,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:12:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1820490976, now seen corresponding path program 2 times [2023-11-29 03:12:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:12:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219436145] [2023-11-29 03:12:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:12:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:12:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:12:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 03:12:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:12:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 03:12:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:12:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 03:12:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 03:12:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 03:12:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 03:12:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 03:12:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:12:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:12:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:12:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 03:12:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:12:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 03:12:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 03:12:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:12:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 03:12:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:12:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219436145] [2023-11-29 03:12:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219436145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:12:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293271374] [2023-11-29 03:12:20,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:12:20,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:12:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:12:20,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:12:20,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4cffb9-27a3-41a9-8f19-6fac07875f82/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:12:20,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:12:20,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:12:20,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 147 conjunts are in the unsatisfiable core [2023-11-29 03:12:20,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:12:21,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-11-29 03:12:21,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:12:21,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 03:12:21,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 03:12:21,075 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:12:21,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 03:12:23,650 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 03:12:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 71 [2023-11-29 03:12:25,279 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:25,652 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1337_23| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1337|) (= (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~loopctr1337_23|))) (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|) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23|))) is different from true [2023-11-29 03:12:25,672 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1337_23| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1337_24| Int)) (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|)) (.cse2 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1337_24|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23|))) (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~loopctr1337_24| 1) |c_#Ultimate.C_memcpy#4_#t~loopctr1337|) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1337_24|) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23|))) is different from true [2023-11-29 03:12:25,705 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy#4_#t~loopctr1337_23| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1337_24| Int) (|v_#Ultimate.C_memcpy#4_#t~loopctr1337_25| Int)) (and (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1337_24| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1337_25|) (= |c_#memory_int#4| (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~loopctr1337_25|))) (store (let ((.cse2 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1337_24|))) (store (let ((.cse0 (+ |c_#Ultimate.C_memcpy#4_dest.offset| |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23|))) (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))))) (<= (+ |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23| 1) |v_#Ultimate.C_memcpy#4_#t~loopctr1337_24|) (<= 0 |v_#Ultimate.C_memcpy#4_#t~loopctr1337_23|))) is different from true [2023-11-29 03:12:30,436 INFO L349 Elim1Store]: treesize reduction 779, result has 17.4 percent of original size [2023-11-29 03:12:30,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 255 treesize of output 359 [2023-11-29 03:12:31,417 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-29 03:12:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-11-29 03:12:31,495 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-29 03:12:31,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-11-29 03:12:31,616 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-29 03:12:31,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 52 [2023-11-29 03:12:32,202 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-29 03:12:32,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 45 [2023-11-29 03:12:32,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 71 [2023-11-29 03:12:32,403 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-29 03:12:32,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 45 [2023-11-29 03:12:32,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2023-11-29 03:12:32,442 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2023-11-29 03:12:32,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 47 [2023-11-29 03:12:32,480 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 122 treesize of output 90 [2023-11-29 03:12:32,505 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-29 03:12:32,505 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 90 treesize of output 114 [2023-11-29 03:12:32,534 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:12:32,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 3 [2023-11-29 03:12:35,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:12:35,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 348 treesize of output 312 [2023-11-29 03:12:35,384 INFO L349 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2023-11-29 03:12:35,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 594 treesize of output 540 [2023-11-29 03:12:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 92 trivial. 6 not checked. [2023-11-29 03:12:35,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293271374] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:50,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:14:50,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36] total 77 [2023-11-29 03:14:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660012123] [2023-11-29 03:14:50,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:14:50,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-11-29 03:14:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:14:50,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-11-29 03:14:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=6562, Unknown=21, NotChecked=492, Total=7310 [2023-11-29 03:14:50,878 INFO L87 Difference]: Start difference. First operand 225 states and 273 transitions. Second operand has 77 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 55 states have internal predecessors, (119), 18 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (41), 21 states have call predecessors, (41), 14 states have call successors, (41) [2023-11-29 03:15:05,499 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:15:18,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:15:23,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:15:26,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:15:34,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:15:40,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:15:49,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:15:59,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:02,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:05,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:10,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:13,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:14,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:17,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:18,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:21,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:25,966 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:29,975 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:32,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:37,434 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:16:38,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:43,799 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:46,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:47,879 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:16:48,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:51,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:56,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:16:59,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:01,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:02,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:05,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:06,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:09,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:17:19,875 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:17:32,382 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:43,809 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:17:47,833 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:18:04,398 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:18:10,369 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:18:48,668 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:18:57,434 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:19:08,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]