./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/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_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/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_6f796073-9e99-4980-9635-a5d71350530c/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 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:31:04,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:31:04,687 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 04:31:04,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:31:04,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:31:04,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:31:04,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:31:04,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:31:04,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:31:04,720 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:31:04,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:31:04,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:31:04,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:31:04,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:31:04,723 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:31:04,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:31:04,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:31:04,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:31:04,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:31:04,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:31:04,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:31:04,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:31:04,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:31:04,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:31:04,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:31:04,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:31:04,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:31:04,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:31:04,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:31:04,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:31:04,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:31:04,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:31:04,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:31:04,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:31:04,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:31:04,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:31:04,733 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:31:04,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:31:04,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:31:04,733 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_6f796073-9e99-4980-9635-a5d71350530c/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_6f796073-9e99-4980-9635-a5d71350530c/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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2023-11-29 04:31:04,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:31:04,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:31:04,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:31:04,954 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:31:04,954 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:31:04,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2023-11-29 04:31:07,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:31:08,080 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:31:08,081 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2023-11-29 04:31:08,108 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/data/eb11cf47a/e99d18dacb244cd8b94d3a9fc6abae27/FLAG7bcc0f0ad [2023-11-29 04:31:08,120 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/data/eb11cf47a/e99d18dacb244cd8b94d3a9fc6abae27 [2023-11-29 04:31:08,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:31:08,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:31:08,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:31:08,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:31:08,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:31:08,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:31:08" (1/1) ... [2023-11-29 04:31:08,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5827fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:08, skipping insertion in model container [2023-11-29 04:31:08,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:31:08" (1/1) ... [2023-11-29 04:31:08,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:31:08,478 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_6f796073-9e99-4980-9635-a5d71350530c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2023-11-29 04:31:08,486 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_6f796073-9e99-4980-9635-a5d71350530c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2023-11-29 04:31:09,225 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,226 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,227 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,227 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,228 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,241 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,241 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,243 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,244 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,245 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,246 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,247 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,248 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,645 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 04:31:09,646 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 04:31:09,647 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 04:31:09,648 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 04:31:09,650 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 04:31:09,651 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 04:31:09,652 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 04:31:09,652 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 04:31:09,653 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 04:31:09,654 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 04:31:09,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:31:09,840 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:31:09,885 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_6f796073-9e99-4980-9635-a5d71350530c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2023-11-29 04:31:09,886 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_6f796073-9e99-4980-9635-a5d71350530c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2023-11-29 04:31:09,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,929 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,930 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,940 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,940 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,942 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,944 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,944 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,945 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 04:31:09,980 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 04:31:09,981 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 04:31:09,982 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 04:31:09,982 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 04:31:09,983 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 04:31:09,984 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 04:31:09,984 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 04:31:09,985 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 04:31:09,985 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 04:31:09,986 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 04:31:10,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:31:10,237 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,237 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,238 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,239 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,239 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,239 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,239 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,239 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:31:10,247 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:31:10,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10 WrapperNode [2023-11-29 04:31:10,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:31:10,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:31:10,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:31:10,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:31:10,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,353 INFO L138 Inliner]: procedures = 678, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 56 [2023-11-29 04:31:10,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:31:10,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:31:10,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:31:10,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:31:10,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,390 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 4, 5, 6]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2023-11-29 04:31:10,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:31:10,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:31:10,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:31:10,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:31:10,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (1/1) ... [2023-11-29 04:31:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:31:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:31:10,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:31:10,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:31:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:31:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 04:31:10,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 04:31:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 04:31:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:31:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:31:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:31:10,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 04:31:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-29 04:31:10,494 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-29 04:31:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:31:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:31:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:31:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:31:10,704 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:31:10,707 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:31:10,854 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:31:10,887 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:31:10,887 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:31:10,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:31:10 BoogieIcfgContainer [2023-11-29 04:31:10,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:31:10,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:31:10,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:31:10,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:31:10,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:31:08" (1/3) ... [2023-11-29 04:31:10,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59df77dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:31:10, skipping insertion in model container [2023-11-29 04:31:10,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:31:10" (2/3) ... [2023-11-29 04:31:10,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59df77dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:31:10, skipping insertion in model container [2023-11-29 04:31:10,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:31:10" (3/3) ... [2023-11-29 04:31:10,896 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2023-11-29 04:31:10,916 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:31:10,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:31:10,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:31:10,974 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;@42f0d094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:31:10,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:31:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 04:31:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:31:10,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:10,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:10,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:10,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash -453311340, now seen corresponding path program 1 times [2023-11-29 04:31:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249603541] [2023-11-29 04:31:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:31:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249603541] [2023-11-29 04:31:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249603541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:11,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:11,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:31:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92965335] [2023-11-29 04:31:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:11,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:31:11,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:31:11,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:31:11,453 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:31:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:11,492 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2023-11-29 04:31:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:31:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-29 04:31:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:11,501 INFO L225 Difference]: With dead ends: 81 [2023-11-29 04:31:11,501 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 04:31:11,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:31:11,507 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:11,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:31:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 04:31:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 04:31:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:31:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-29 04:31:11,545 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2023-11-29 04:31:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:11,546 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-29 04:31:11,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 04:31:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-29 04:31:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:31:11,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:11,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:11,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:31:11,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:11,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1733175018, now seen corresponding path program 1 times [2023-11-29 04:31:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:11,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981512588] [2023-11-29 04:31:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:31:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981512588] [2023-11-29 04:31:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981512588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:31:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949764546] [2023-11-29 04:31:12,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:12,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:31:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:12,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:31:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:31:12,802 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:31:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:13,109 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-11-29 04:31:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:31:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 04:31:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:13,112 INFO L225 Difference]: With dead ends: 51 [2023-11-29 04:31:13,113 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 04:31:13,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:31:13,115 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:13,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 245 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:31:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 04:31:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-29 04:31:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 04:31:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-11-29 04:31:13,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 25 [2023-11-29 04:31:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:13,129 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-11-29 04:31:13,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:31:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-11-29 04:31:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:31:13,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:13,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:13,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:31:13,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:13,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 41832344, now seen corresponding path program 1 times [2023-11-29 04:31:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:13,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103878619] [2023-11-29 04:31:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:13,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:31:13,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:13,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103878619] [2023-11-29 04:31:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103878619] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035383075] [2023-11-29 04:31:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:31:13,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:31:13,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:31:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:14,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 04:31:14,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:14,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:31:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:31:14,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:31:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035383075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:31:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-11-29 04:31:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421090010] [2023-11-29 04:31:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:31:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:31:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:31:14,555 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:31:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:15,016 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-11-29 04:31:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:31:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 04:31:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:15,020 INFO L225 Difference]: With dead ends: 99 [2023-11-29 04:31:15,021 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 04:31:15,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:31:15,023 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:15,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 118 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:31:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 04:31:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-29 04:31:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-29 04:31:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-29 04:31:15,037 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-29 04:31:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:15,037 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-29 04:31:15,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:31:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-29 04:31:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:31:15,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:15,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:15,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:31:15,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:15,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:15,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:15,243 INFO L85 PathProgramCache]: Analyzing trace with hash 721890714, now seen corresponding path program 1 times [2023-11-29 04:31:15,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:15,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234401048] [2023-11-29 04:31:15,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:15,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:31:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234401048] [2023-11-29 04:31:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234401048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:31:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436573410] [2023-11-29 04:31:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:31:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:31:15,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:31:15,397 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:31:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:15,448 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-11-29 04:31:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:31:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 04:31:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:15,450 INFO L225 Difference]: With dead ends: 103 [2023-11-29 04:31:15,450 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 04:31:15,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:31:15,452 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:15,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:31:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 04:31:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-29 04:31:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-29 04:31:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-29 04:31:15,464 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2023-11-29 04:31:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:15,464 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-29 04:31:15,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:31:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-29 04:31:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:31:15,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:15,466 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:31:15,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:31:15,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:15,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1922221686, now seen corresponding path program 1 times [2023-11-29 04:31:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970095955] [2023-11-29 04:31:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:31:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970095955] [2023-11-29 04:31:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970095955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:31:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447302200] [2023-11-29 04:31:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:16,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:31:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:16,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:31:16,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:31:16,526 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 04:31:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:16,826 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-11-29 04:31:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:31:16,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-11-29 04:31:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:16,828 INFO L225 Difference]: With dead ends: 59 [2023-11-29 04:31:16,828 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 04:31:16,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:31:16,829 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:16,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 297 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:31:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 04:31:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-11-29 04:31:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 04:31:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-11-29 04:31:16,843 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2023-11-29 04:31:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:16,843 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-29 04:31:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 04:31:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-11-29 04:31:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:31:16,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:16,845 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:31:16,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:31:16,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:16,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash -147214324, now seen corresponding path program 1 times [2023-11-29 04:31:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792766167] [2023-11-29 04:31:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:31:17,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:17,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792766167] [2023-11-29 04:31:17,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792766167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:17,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:17,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:31:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023754874] [2023-11-29 04:31:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:17,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:31:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:31:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:31:17,290 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:31:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:17,483 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2023-11-29 04:31:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:31:17,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 04:31:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:17,485 INFO L225 Difference]: With dead ends: 96 [2023-11-29 04:31:17,485 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 04:31:17,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:31:17,487 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:17,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 173 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:31:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 04:31:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-29 04:31:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-29 04:31:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-11-29 04:31:17,501 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2023-11-29 04:31:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:17,501 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-11-29 04:31:17,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:31:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-11-29 04:31:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:31:17,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:17,503 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 04:31:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:31:17,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:17,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 532844046, now seen corresponding path program 1 times [2023-11-29 04:31:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005107281] [2023-11-29 04:31:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:31:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005107281] [2023-11-29 04:31:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005107281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558044145] [2023-11-29 04:31:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:31:17,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:31:17,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:31:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:31:18,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:18,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:31:18,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 04:31:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:31:18,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:31:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:31:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558044145] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:31:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 13 [2023-11-29 04:31:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943240247] [2023-11-29 04:31:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:18,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:31:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:31:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:31:18,400 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:31:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:18,487 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2023-11-29 04:31:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:31:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 04:31:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:18,489 INFO L225 Difference]: With dead ends: 105 [2023-11-29 04:31:18,489 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 04:31:18,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:31:18,491 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:18,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 156 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:31:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 04:31:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-29 04:31:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 04:31:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-29 04:31:18,502 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2023-11-29 04:31:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:18,503 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-29 04:31:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:31:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-29 04:31:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:31:18,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:18,505 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:18,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:31:18,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:18,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:18,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 327910959, now seen corresponding path program 1 times [2023-11-29 04:31:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345549805] [2023-11-29 04:31:18,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:31:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:31:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345549805] [2023-11-29 04:31:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345549805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:19,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:31:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127491408] [2023-11-29 04:31:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:19,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:31:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:31:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:31:19,002 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 04:31:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:19,113 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-11-29 04:31:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:31:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-11-29 04:31:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:19,116 INFO L225 Difference]: With dead ends: 63 [2023-11-29 04:31:19,116 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 04:31:19,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:31:19,118 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:19,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 204 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:31:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 04:31:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 04:31:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 04:31:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-11-29 04:31:19,132 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 44 [2023-11-29 04:31:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:19,132 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-11-29 04:31:19,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 04:31:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-11-29 04:31:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 04:31:19,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:19,134 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:19,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:31:19,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:19,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1816182815, now seen corresponding path program 1 times [2023-11-29 04:31:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293042414] [2023-11-29 04:31:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:31:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:31:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:31:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 04:31:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293042414] [2023-11-29 04:31:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293042414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:31:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598598001] [2023-11-29 04:31:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:20,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:31:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:20,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:31:20,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:31:20,050 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 04:31:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:20,345 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2023-11-29 04:31:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:31:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-29 04:31:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:20,347 INFO L225 Difference]: With dead ends: 71 [2023-11-29 04:31:20,347 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 04:31:20,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:31:20,348 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:20,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:31:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 04:31:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-29 04:31:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 04:31:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-29 04:31:20,362 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 57 [2023-11-29 04:31:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:20,363 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-29 04:31:20,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 04:31:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-29 04:31:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 04:31:20,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:20,365 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:20,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:31:20,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:20,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash -703777119, now seen corresponding path program 1 times [2023-11-29 04:31:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606456493] [2023-11-29 04:31:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:31:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:31:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:31:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 04:31:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606456493] [2023-11-29 04:31:21,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606456493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:21,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:21,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 04:31:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860359095] [2023-11-29 04:31:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:31:21,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:31:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:31:21,085 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 04:31:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:21,424 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2023-11-29 04:31:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:31:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 57 [2023-11-29 04:31:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:21,426 INFO L225 Difference]: With dead ends: 98 [2023-11-29 04:31:21,426 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 04:31:21,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:31:21,427 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:21,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 200 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:31:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 04:31:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2023-11-29 04:31:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 04:31:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2023-11-29 04:31:21,441 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 57 [2023-11-29 04:31:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:21,442 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2023-11-29 04:31:21,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 04:31:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2023-11-29 04:31:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 04:31:21,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:21,444 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:21,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:31:21,444 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:21,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -23718749, now seen corresponding path program 1 times [2023-11-29 04:31:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826690778] [2023-11-29 04:31:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:31:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:31:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:31:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 04:31:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:21,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826690778] [2023-11-29 04:31:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826690778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:31:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160512847] [2023-11-29 04:31:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:21,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:31:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:31:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:31:21,640 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 04:31:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:21,680 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2023-11-29 04:31:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:31:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-29 04:31:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:21,681 INFO L225 Difference]: With dead ends: 96 [2023-11-29 04:31:21,681 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 04:31:21,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:31:21,683 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:21,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 120 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:31:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 04:31:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-29 04:31:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-29 04:31:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 04:31:21,694 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 57 [2023-11-29 04:31:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:21,694 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 04:31:21,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 04:31:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-29 04:31:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:31:21,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:21,696 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:21,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:31:21,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:21,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -236391893, now seen corresponding path program 1 times [2023-11-29 04:31:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:21,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700451864] [2023-11-29 04:31:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:31:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:31:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:31:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:31:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:31:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 04:31:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700451864] [2023-11-29 04:31:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700451864] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861616508] [2023-11-29 04:31:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:31:23,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:31:23,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:31:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:23,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-29 04:31:23,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:23,733 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 23 treesize of output 15 [2023-11-29 04:31:23,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:31:23,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:31:23,750 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 23 treesize of output 15 [2023-11-29 04:31:25,920 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-29 04:31:25,921 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 123 [2023-11-29 04:31:25,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:25,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 59 [2023-11-29 04:31:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 04:31:25,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:31:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 04:31:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861616508] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:31:35,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:31:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 44 [2023-11-29 04:31:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878969000] [2023-11-29 04:31:35,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:31:35,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 04:31:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 04:31:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1726, Unknown=1, NotChecked=0, Total=1892 [2023-11-29 04:31:35,109 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 44 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 36 states have internal predecessors, (80), 16 states have call successors, (32), 4 states have call predecessors, (32), 9 states have return successors, (30), 16 states have call predecessors, (30), 14 states have call successors, (30) [2023-11-29 04:31:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:36,566 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2023-11-29 04:31:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:31:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 36 states have internal predecessors, (80), 16 states have call successors, (32), 4 states have call predecessors, (32), 9 states have return successors, (30), 16 states have call predecessors, (30), 14 states have call successors, (30) Word has length 70 [2023-11-29 04:31:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:36,567 INFO L225 Difference]: With dead ends: 73 [2023-11-29 04:31:36,567 INFO L226 Difference]: Without dead ends: 71 [2023-11-29 04:31:36,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 120 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=307, Invalid=2884, Unknown=1, NotChecked=0, Total=3192 [2023-11-29 04:31:36,569 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:36,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 368 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:31:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-29 04:31:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-11-29 04:31:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-29 04:31:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2023-11-29 04:31:36,582 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 70 [2023-11-29 04:31:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:36,582 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2023-11-29 04:31:36,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 36 states have internal predecessors, (80), 16 states have call successors, (32), 4 states have call predecessors, (32), 9 states have return successors, (30), 16 states have call predecessors, (30), 14 states have call successors, (30) [2023-11-29 04:31:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2023-11-29 04:31:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:31:36,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:36,584 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:36,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 04:31:36,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 04:31:36,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:31:36,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1538615469, now seen corresponding path program 1 times [2023-11-29 04:31:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130262136] [2023-11-29 04:31:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:31:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:31:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:31:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:31:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:31:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:31:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:31:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:31:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:31:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:31:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 04:31:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:37,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130262136] [2023-11-29 04:31:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130262136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:37,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735455513] [2023-11-29 04:31:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:31:37,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:31:37,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:31:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:37,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 04:31:37,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:37,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:31:41,594 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_17| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_17|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_11|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_17| Int)) (not (= 0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_17|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_11|))))) is different from true [2023-11-29 04:31:45,628 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (not (= 0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|))))) is different from true [2023-11-29 04:31:49,667 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2023-11-29 04:31:53,714 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2023-11-29 04:31:57,754 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_9| Int)) (not (= 0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9|) 0)))) is different from true [2023-11-29 04:32:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2023-11-29 04:32:14,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:14,290 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 04:32:14,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 04:32:14,298 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 04:32:14,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:32:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 04:32:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735455513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:32:14,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:32:14,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 12] total 25 [2023-11-29 04:32:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403713597] [2023-11-29 04:32:14,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:32:14,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 04:32:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:14,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 04:32:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=320, Unknown=9, NotChecked=200, Total=600 [2023-11-29 04:32:14,313 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 04:32:18,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:32:22,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:32:26,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:32:38,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:32:42,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:32:58,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:33:02,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:33:06,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:33:10,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:33:30,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:33:34,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:33:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:42,801 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2023-11-29 04:33:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:33:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 70 [2023-11-29 04:33:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:42,803 INFO L225 Difference]: With dead ends: 91 [2023-11-29 04:33:42,803 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 04:33:42,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 141 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 80.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=20, NotChecked=270, Total=992 [2023-11-29 04:33:42,804 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 304 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 11 Unknown, 672 Unchecked, 44.2s Time] [2023-11-29 04:33:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 04:33:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-29 04:33:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-29 04:33:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-29 04:33:42,818 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 70 [2023-11-29 04:33:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:42,819 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-29 04:33:42,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 24 states have internal predecessors, (56), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 04:33:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-29 04:33:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:33:42,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:42,820 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:33:42,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:33:43,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 04:33:43,021 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:43,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2076293457, now seen corresponding path program 1 times [2023-11-29 04:33:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:33:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733758381] [2023-11-29 04:33:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:33:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:33:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:33:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:33:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:33:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:33:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:33:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:33:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:33:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:33:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:33:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 04:33:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:33:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733758381] [2023-11-29 04:33:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733758381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:33:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144439429] [2023-11-29 04:33:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:33:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:33:43,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:33:43,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:33:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:43,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 04:33:43,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:43,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:33:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 04:33:43,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:33:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 04:33:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144439429] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:33:43,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:33:43,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2023-11-29 04:33:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590593454] [2023-11-29 04:33:43,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:33:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:33:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:33:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:33:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:33:43,828 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 04:33:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:44,000 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2023-11-29 04:33:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:33:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 70 [2023-11-29 04:33:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:44,001 INFO L225 Difference]: With dead ends: 89 [2023-11-29 04:33:44,001 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 04:33:44,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:33:44,002 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:44,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 292 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:33:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 04:33:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-11-29 04:33:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:33:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2023-11-29 04:33:44,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 70 [2023-11-29 04:33:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:44,015 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2023-11-29 04:33:44,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 04:33:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2023-11-29 04:33:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 04:33:44,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:44,016 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:33:44,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:33:44,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 04:33:44,217 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:44,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1060475130, now seen corresponding path program 1 times [2023-11-29 04:33:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:33:44,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970427924] [2023-11-29 04:33:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:44,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:33:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:33:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:33:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:33:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 04:33:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 04:33:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 04:33:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:33:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:33:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:33:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:33:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 04:33:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 04:33:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:33:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970427924] [2023-11-29 04:33:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970427924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:33:44,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:33:44,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:33:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370463828] [2023-11-29 04:33:44,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:33:44,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:33:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:33:44,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:33:44,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:33:44,630 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 04:33:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:44,757 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2023-11-29 04:33:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:33:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 76 [2023-11-29 04:33:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:44,757 INFO L225 Difference]: With dead ends: 65 [2023-11-29 04:33:44,758 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:33:44,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:33:44,758 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:44,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:33:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:33:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:33:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:33:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:33:44,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-29 04:33:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:44,760 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:33:44,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 04:33:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:33:44,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:33:44,762 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:33:44,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:33:44,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:33:45,752 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2023-11-29 04:33:45,752 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2023-11-29 04:33:45,752 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2023-11-29 04:33:45,752 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2023-11-29 04:33:45,752 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2023-11-29 04:33:45,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:33:45,754 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 0)) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$#3.offset| .cse1) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$#3.base| .cse1) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-29 04:33:45,754 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2023-11-29 04:33:45,754 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 0)) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$#3.offset| .cse1) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$#3.base| .cse1) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret680#1| 1) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-29 04:33:45,754 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 0)) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$#3.offset| .cse1) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$#3.base| .cse1) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-29 04:33:45,754 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret344#1| 1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse0) 0) 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2023-11-29 04:33:45,754 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2023-11-29 04:33:45,754 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse0) 0) 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2023-11-29 04:33:45,754 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:33:45,754 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 0)) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$#3.offset| .cse1) 8) 0) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$#3.base| .cse1) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-29 04:33:45,755 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2023-11-29 04:33:45,755 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 0)) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$#3.offset| .cse1) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret681#1| 1) (not (= .cse0 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$#3.base| .cse1) 8)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-29 04:33:45,755 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse0) 0) 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2023-11-29 04:33:45,755 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret343#1| 1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse0) 0) 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2023-11-29 04:33:45,755 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem345#1.offset| 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse0) 0) 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem345#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2023-11-29 04:33:45,755 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2023-11-29 04:33:45,755 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2023-11-29 04:33:45,755 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 0))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (not (= .cse1 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$#1.offset| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0)))) [2023-11-29 04:33:45,755 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2023-11-29 04:33:45,755 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 0))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (not (= .cse1 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$#1.offset| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0)))) [2023-11-29 04:33:45,756 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-29 04:33:45,756 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-29 04:33:45,756 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-29 04:33:45,756 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-29 04:33:45,756 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-29 04:33:45,756 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-29 04:33:45,758 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:33:45,760 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:33:45,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:33:45 BoogieIcfgContainer [2023-11-29 04:33:45,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:33:45,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:33:45,765 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:33:45,765 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:33:45,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:31:10" (3/4) ... [2023-11-29 04:33:45,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:33:45,769 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-29 04:33:45,769 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-29 04:33:45,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:33:45,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 04:33:45,774 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-29 04:33:45,774 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 04:33:45,774 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:33:45,775 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:33:45,860 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:33:45,860 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:33:45,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:33:45,861 INFO L158 Benchmark]: Toolchain (without parser) took 157737.56ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 141.0MB in the beginning and 318.0MB in the end (delta: -177.0MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,862 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory was 53.8MB in the beginning and 53.7MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:33:45,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2122.50ms. Allocated memory is still 178.3MB. Free memory was 140.6MB in the beginning and 120.0MB in the end (delta: 20.5MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.43ms. Allocated memory is still 178.3MB. Free memory was 120.0MB in the beginning and 114.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,863 INFO L158 Benchmark]: Boogie Preprocessor took 63.51ms. Allocated memory is still 178.3MB. Free memory was 114.7MB in the beginning and 111.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,864 INFO L158 Benchmark]: RCFGBuilder took 468.59ms. Allocated memory is still 178.3MB. Free memory was 111.7MB in the beginning and 88.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,864 INFO L158 Benchmark]: TraceAbstraction took 154875.18ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 88.6MB in the beginning and 323.3MB in the end (delta: -234.7MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,865 INFO L158 Benchmark]: Witness Printer took 96.31ms. Allocated memory is still 432.0MB. Free memory was 323.3MB in the beginning and 318.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:33:45,867 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory was 53.8MB in the beginning and 53.7MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2122.50ms. Allocated memory is still 178.3MB. Free memory was 140.6MB in the beginning and 120.0MB in the end (delta: 20.5MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.43ms. Allocated memory is still 178.3MB. Free memory was 120.0MB in the beginning and 114.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.51ms. Allocated memory is still 178.3MB. Free memory was 114.7MB in the beginning and 111.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.59ms. Allocated memory is still 178.3MB. Free memory was 111.7MB in the beginning and 88.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 154875.18ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 88.6MB in the beginning and 323.3MB in the end (delta: -234.7MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. * Witness Printer took 96.31ms. Allocated memory is still 432.0MB. Free memory was 323.3MB in the beginning and 318.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 154.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 92.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 46.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 3074 SdHoareTripleChecker+Invalid, 46.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 672 IncrementalHoareTripleChecker+Unchecked, 2449 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2284 IncrementalHoareTripleChecker+Invalid, 3085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 625 mSDtfsCounter, 2284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 876 GetRequests, 644 SyntacticMatches, 27 SemanticMatches, 205 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 93.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=13, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 20 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 87 PreInvPairs, 98 NumberOfFragments, 970 HoareAnnotationTreeSize, 87 FomulaSimplifications, 846 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1891 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 58.5s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1212 ConstructedInterpolants, 109 QuantifiedInterpolants, 10366 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1429 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 694/770 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 04:33:45,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f796073-9e99-4980-9635-a5d71350530c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE