./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 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/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_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ --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.3-dev-30e01a7 [2023-11-23 22:28:44,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:28:44,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 22:28:44,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:28:44,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:28:44,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:28:44,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:28:44,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:28:44,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:28:44,946 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:28:44,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:28:44,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:28:44,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:28:44,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:28:44,951 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:28:44,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:28:44,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:28:44,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:28:44,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:28:44,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:28:44,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:28:44,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:28:44,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:28:44,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:28:44,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:28:44,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:28:44,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:28:44,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:28:44,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:28:44,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:28:44,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:28:44,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:28:44,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:28:44,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:28:44,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:28:44,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:28:44,962 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:28:44,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:28:44,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:28:44,963 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_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/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_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ 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-23 22:28:45,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:28:45,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:28:45,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:28:45,322 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:28:45,323 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:28:45,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2023-11-23 22:28:48,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:28:49,128 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:28:49,128 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2023-11-23 22:28:49,180 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/data/93f84ce36/c671d86b9274496a96e8baf1b76ccb6d/FLAG1a7b69b09 [2023-11-23 22:28:49,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/data/93f84ce36/c671d86b9274496a96e8baf1b76ccb6d [2023-11-23 22:28:49,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:28:49,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:28:49,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:28:49,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:28:49,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:28:49,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:49" (1/1) ... [2023-11-23 22:28:49,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f028e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:49, skipping insertion in model container [2023-11-23 22:28:49,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:49" (1/1) ... [2023-11-23 22:28:49,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:28:49,679 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_1e52a990-43f5-4a35-bd57-eafc0ced6051/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2023-11-23 22:28:49,688 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_1e52a990-43f5-4a35-bd57-eafc0ced6051/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2023-11-23 22:28:50,814 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,815 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,815 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,817 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,818 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,834 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,835 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,838 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,838 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,841 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,870 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,871 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:50,872 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,299 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 22:28:51,301 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 22:28:51,302 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 22:28:51,304 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 22:28:51,306 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 22:28:51,307 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 22:28:51,308 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 22:28:51,309 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 22:28:51,310 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 22:28:51,311 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 22:28:51,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:28:51,558 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:28:51,586 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_1e52a990-43f5-4a35-bd57-eafc0ced6051/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2023-11-23 22:28:51,587 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_1e52a990-43f5-4a35-bd57-eafc0ced6051/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2023-11-23 22:28:51,681 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,682 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,686 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,697 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,699 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,726 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,728 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,730 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,732 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,733 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,740 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,741 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,741 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 22:28:51,809 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 22:28:51,810 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 22:28:51,811 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 22:28:51,812 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 22:28:51,821 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 22:28:51,822 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 22:28:51,823 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 22:28:51,826 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 22:28:51,828 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 22:28:51,828 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 22:28:51,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:28:52,239 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,240 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,240 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,240 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,240 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,241 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,241 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,242 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,242 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,242 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,242 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,243 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,244 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,244 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,244 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:52,252 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:28:52,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52 WrapperNode [2023-11-23 22:28:52,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:28:52,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:28:52,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:28:52,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:28:52,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,381 INFO L138 Inliner]: procedures = 678, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 56 [2023-11-23 22:28:52,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:28:52,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:28:52,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:28:52,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:28:52,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,404 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,423 INFO L189 HeapSplitter]: Split 17 memory accesses to 4 slices as follows [2, 6, 5, 4] [2023-11-23 22:28:52,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:28:52,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:28:52,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:28:52,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:28:52,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (1/1) ... [2023-11-23 22:28:52,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:28:52,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:52,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:28:52,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:28:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:28:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 22:28:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 22:28:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 22:28:52,549 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 22:28:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:28:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 22:28:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 22:28:52,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 22:28:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 22:28:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:28:52,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:28:52,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:28:52,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:28:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:28:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 22:28:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 22:28:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 22:28:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 22:28:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 22:28:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 22:28:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 22:28:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 22:28:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 22:28:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 22:28:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:28:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:28:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 22:28:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 22:28:52,909 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:28:52,912 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:28:53,080 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:28:53,118 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:28:53,119 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 22:28:53,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:53 BoogieIcfgContainer [2023-11-23 22:28:53,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:28:53,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:28:53,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:28:53,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:28:53,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:49" (1/3) ... [2023-11-23 22:28:53,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecd03ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:53, skipping insertion in model container [2023-11-23 22:28:53,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:52" (2/3) ... [2023-11-23 22:28:53,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecd03ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:53, skipping insertion in model container [2023-11-23 22:28:53,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:53" (3/3) ... [2023-11-23 22:28:53,129 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2023-11-23 22:28:53,151 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:28:53,151 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:28:53,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:28:53,210 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;@298e688d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:28:53,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:28:53,215 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-23 22:28:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 22:28:53,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:28:53,225 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-23 22:28:53,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:28:53,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash -453311340, now seen corresponding path program 1 times [2023-11-23 22:28:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379198288] [2023-11-23 22:28:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:28:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:28:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:28:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:53,725 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-23 22:28:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379198288] [2023-11-23 22:28:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379198288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:28:53,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:28:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35362923] [2023-11-23 22:28:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:53,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:28:53,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:28:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:28:53,789 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-23 22:28:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:28:53,844 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2023-11-23 22:28:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:28:53,848 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-23 22:28:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:28:53,858 INFO L225 Difference]: With dead ends: 81 [2023-11-23 22:28:53,859 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 22:28:53,866 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-23 22:28:53,871 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-23 22:28:53,872 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-23 22:28:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 22:28:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-23 22:28:53,924 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-23 22:28:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-23 22:28:53,932 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2023-11-23 22:28:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:28:53,940 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-23 22:28:53,944 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-23 22:28:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-23 22:28:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 22:28:53,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:28:53,948 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-23 22:28:53,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:28:53,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:28:53,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1733175018, now seen corresponding path program 1 times [2023-11-23 22:28:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313119137] [2023-11-23 22:28:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:28:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:55,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:28:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:28:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:55,723 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-23 22:28:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313119137] [2023-11-23 22:28:55,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313119137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:55,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:28:55,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:28:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816261689] [2023-11-23 22:28:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:55,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:28:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:28:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:28:55,728 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-23 22:28:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:28:56,027 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-11-23 22:28:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 22:28:56,027 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-23 22:28:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:28:56,030 INFO L225 Difference]: With dead ends: 51 [2023-11-23 22:28:56,031 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 22:28:56,031 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-23 22:28:56,046 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-23 22:28:56,047 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-23 22:28:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 22:28:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-23 22:28:56,071 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-23 22:28:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-11-23 22:28:56,075 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 25 [2023-11-23 22:28:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:28:56,076 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-11-23 22:28:56,077 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-23 22:28:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-11-23 22:28:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 22:28:56,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:28:56,080 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-23 22:28:56,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:28:56,083 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:28:56,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 41832344, now seen corresponding path program 1 times [2023-11-23 22:28:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502067613] [2023-11-23 22:28:56,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:28:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:28:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:28:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:57,168 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-23 22:28:57,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502067613] [2023-11-23 22:28:57,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502067613] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:28:57,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111017558] [2023-11-23 22:28:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:57,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:28:57,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:28:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:57,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-23 22:28:57,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:28:57,443 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 19 treesize of output 1 [2023-11-23 22:28:58,038 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-23 22:28:58,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:28:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111017558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:58,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:28:58,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2023-11-23 22:28:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293331467] [2023-11-23 22:28:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:58,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:28:58,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:28:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:28:58,041 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-23 22:28:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:28:58,526 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-11-23 22:28:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:28:58,526 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-23 22:28:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:28:58,528 INFO L225 Difference]: With dead ends: 99 [2023-11-23 22:28:58,528 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 22:28:58,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 22:28:58,530 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:28:58,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 118 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:28:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 22:28:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-23 22:28:58,543 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-23 22:28:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-23 22:28:58,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-23 22:28:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:28:58,549 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-23 22:28:58,549 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-23 22:28:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-23 22:28:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 22:28:58,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:28:58,556 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-23 22:28:58,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 22:28:58,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:58,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:28:58,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 721890714, now seen corresponding path program 1 times [2023-11-23 22:28:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348295226] [2023-11-23 22:28:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:28:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:28:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:58,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:28:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:58,953 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-23 22:28:58,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:58,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348295226] [2023-11-23 22:28:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348295226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:58,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:28:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:28:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737221714] [2023-11-23 22:28:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:58,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:28:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:28:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:28:58,956 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-23 22:28:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:28:59,031 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-11-23 22:28:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:28:59,031 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-23 22:28:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:28:59,034 INFO L225 Difference]: With dead ends: 103 [2023-11-23 22:28:59,034 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 22:28:59,038 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-23 22:28:59,041 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:28:59,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:28:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 22:28:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-23 22:28:59,059 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-23 22:28:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-23 22:28:59,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2023-11-23 22:28:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:28:59,061 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-23 22:28:59,061 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-23 22:28:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-23 22:28:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 22:28:59,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:28:59,062 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-23 22:28:59,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:28:59,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:28:59,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1922221686, now seen corresponding path program 1 times [2023-11-23 22:28:59,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:59,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538452170] [2023-11-23 22:28:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,458 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-23 22:29:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538452170] [2023-11-23 22:29:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538452170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:00,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:00,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 22:29:00,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641963753] [2023-11-23 22:29:00,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:00,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 22:29:00,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:00,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 22:29:00,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:29:00,461 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-23 22:29:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:00,779 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-11-23 22:29:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:29:00,779 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-23 22:29:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:00,781 INFO L225 Difference]: With dead ends: 59 [2023-11-23 22:29:00,781 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 22:29:00,782 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-23 22:29:00,782 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:00,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 324 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:29:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 22:29:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-11-23 22:29:00,795 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-23 22:29:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-11-23 22:29:00,796 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2023-11-23 22:29:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:00,797 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-23 22:29:00,797 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-23 22:29:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-11-23 22:29:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 22:29:00,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:00,799 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-23 22:29:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:29:00,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:00,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash -147214324, now seen corresponding path program 1 times [2023-11-23 22:29:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233465687] [2023-11-23 22:29:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,413 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-23 22:29:01,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:01,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233465687] [2023-11-23 22:29:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233465687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:01,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:29:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249102807] [2023-11-23 22:29:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:01,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:29:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:29:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:29:01,416 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-23 22:29:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:01,621 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2023-11-23 22:29:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:29:01,622 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-23 22:29:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:01,623 INFO L225 Difference]: With dead ends: 96 [2023-11-23 22:29:01,623 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 22:29:01,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-23 22:29:01,625 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:01,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 173 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:29:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 22:29:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-23 22:29:01,637 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-23 22:29:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-11-23 22:29:01,638 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2023-11-23 22:29:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:01,639 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-11-23 22:29:01,639 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-23 22:29:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-11-23 22:29:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 22:29:01,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:01,641 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-23 22:29:01,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:29:01,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:01,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 532844046, now seen corresponding path program 1 times [2023-11-23 22:29:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279990680] [2023-11-23 22:29:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:01,968 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-23 22:29:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279990680] [2023-11-23 22:29:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279990680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:01,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:29:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614086355] [2023-11-23 22:29:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:01,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:29:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:29:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:29:01,971 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-23 22:29:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:02,065 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2023-11-23 22:29:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:29:02,066 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-23 22:29:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:02,068 INFO L225 Difference]: With dead ends: 105 [2023-11-23 22:29:02,068 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 22:29:02,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:29:02,069 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:02,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:29:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 22:29:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-23 22:29:02,084 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-23 22:29:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-23 22:29:02,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2023-11-23 22:29:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:02,086 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-23 22:29:02,086 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-23 22:29:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-23 22:29:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 22:29:02,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:02,089 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-23 22:29:02,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:29:02,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:02,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash 327910959, now seen corresponding path program 1 times [2023-11-23 22:29:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:02,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553222407] [2023-11-23 22:29:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:02,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:02,419 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-23 22:29:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553222407] [2023-11-23 22:29:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553222407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:29:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043707699] [2023-11-23 22:29:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:29:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:29:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:29:02,422 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-23 22:29:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:02,532 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-11-23 22:29:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:29:02,532 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-23 22:29:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:02,534 INFO L225 Difference]: With dead ends: 63 [2023-11-23 22:29:02,534 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 22:29:02,534 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-23 22:29:02,535 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-23 22:29:02,535 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-23 22:29:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 22:29:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 22:29:02,547 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-23 22:29:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-11-23 22:29:02,548 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 44 [2023-11-23 22:29:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:02,549 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-11-23 22:29:02,549 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-23 22:29:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-11-23 22:29:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 22:29:02,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:02,551 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-23 22:29:02,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:29:02,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:02,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1816182815, now seen corresponding path program 1 times [2023-11-23 22:29:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685180148] [2023-11-23 22:29:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,746 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-23 22:29:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685180148] [2023-11-23 22:29:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685180148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:03,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:29:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088142505] [2023-11-23 22:29:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:03,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:29:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:29:03,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:29:03,750 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-23 22:29:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:04,067 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2023-11-23 22:29:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 22:29:04,068 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-23 22:29:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:04,071 INFO L225 Difference]: With dead ends: 71 [2023-11-23 22:29:04,071 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 22:29:04,071 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-23 22:29:04,072 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-23 22:29:04,072 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-23 22:29:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 22:29:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 22:29:04,093 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-23 22:29:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-23 22:29:04,094 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 57 [2023-11-23 22:29:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:04,095 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-23 22:29:04,095 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-23 22:29:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-23 22:29:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 22:29:04,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:04,097 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-23 22:29:04,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:29:04,097 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:04,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash -703777119, now seen corresponding path program 1 times [2023-11-23 22:29:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:04,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279592530] [2023-11-23 22:29:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,629 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-23 22:29:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279592530] [2023-11-23 22:29:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279592530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:29:04,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719984284] [2023-11-23 22:29:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:04,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:29:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:04,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:29:04,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:29:04,633 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 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-23 22:29:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:04,825 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2023-11-23 22:29:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:29:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 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-23 22:29:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:04,827 INFO L225 Difference]: With dead ends: 92 [2023-11-23 22:29:04,827 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 22:29:04,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:29:04,828 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:04,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:29:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 22:29:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 22:29:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 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-23 22:29:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-11-23 22:29:04,851 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 57 [2023-11-23 22:29:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:04,853 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-11-23 22:29:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-23 22:29:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-11-23 22:29:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 22:29:04,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:04,858 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-23 22:29:04,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:29:04,859 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:04,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -23718749, now seen corresponding path program 1 times [2023-11-23 22:29:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798461726] [2023-11-23 22:29:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,153 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-23 22:29:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798461726] [2023-11-23 22:29:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798461726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:05,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:05,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:29:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396498516] [2023-11-23 22:29:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:05,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:29:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:29:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:29:05,156 INFO L87 Difference]: Start difference. First operand 68 states and 77 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-23 22:29:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:05,219 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2023-11-23 22:29:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:29:05,220 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-23 22:29:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:05,224 INFO L225 Difference]: With dead ends: 94 [2023-11-23 22:29:05,224 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 22:29:05,224 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-23 22:29:05,225 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:05,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 161 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:29:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 22:29:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 22:29:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 12 states have call successors, (12), 8 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-23 22:29:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-23 22:29:05,239 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 57 [2023-11-23 22:29:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:05,240 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-23 22:29:05,241 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-23 22:29:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-23 22:29:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 22:29:05,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:05,242 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-23 22:29:05,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:29:05,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:05,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash -236391893, now seen corresponding path program 1 times [2023-11-23 22:29:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:05,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589820641] [2023-11-23 22:29:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:06,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:06,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:29:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:29:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,619 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-23 22:29:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589820641] [2023-11-23 22:29:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589820641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:07,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336006871] [2023-11-23 22:29:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:07,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:07,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:07,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:07,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:29:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:07,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-23 22:29:07,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:07,833 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 19 treesize of output 11 [2023-11-23 22:29:07,840 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 19 treesize of output 11 [2023-11-23 22:29:07,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 22:29:07,857 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-23 22:29:10,975 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-23 22:29:10,975 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 125 treesize of output 87 [2023-11-23 22:29:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 22:29:11,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:29:14,496 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-23 22:29:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336006871] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:29:14,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:29:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 43 [2023-11-23 22:29:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638177026] [2023-11-23 22:29:14,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:29:14,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-23 22:29:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-23 22:29:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1652, Unknown=1, NotChecked=0, Total=1806 [2023-11-23 22:29:14,502 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 43 states, 33 states have (on average 2.606060606060606) internal successors, (86), 35 states have internal predecessors, (86), 15 states have call successors, (30), 4 states have call predecessors, (30), 9 states have return successors, (29), 15 states have call predecessors, (29), 13 states have call successors, (29) [2023-11-23 22:29:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:16,626 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-23 22:29:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 22:29:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 2.606060606060606) internal successors, (86), 35 states have internal predecessors, (86), 15 states have call successors, (30), 4 states have call predecessors, (30), 9 states have return successors, (29), 15 states have call predecessors, (29), 13 states have call successors, (29) Word has length 70 [2023-11-23 22:29:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:16,628 INFO L225 Difference]: With dead ends: 71 [2023-11-23 22:29:16,628 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 22:29:16,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 120 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=300, Invalid=2891, Unknown=1, NotChecked=0, Total=3192 [2023-11-23 22:29:16,630 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:16,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 431 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 22:29:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 22:29:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 22:29:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 46 states have internal predecessors, (47), 13 states have call successors, (13), 9 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-23 22:29:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-23 22:29:16,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 70 [2023-11-23 22:29:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:16,653 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-23 22:29:16,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 2.606060606060606) internal successors, (86), 35 states have internal predecessors, (86), 15 states have call successors, (30), 4 states have call predecessors, (30), 9 states have return successors, (29), 15 states have call predecessors, (29), 13 states have call successors, (29) [2023-11-23 22:29:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-23 22:29:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 22:29:16,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:16,655 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-23 22:29:16,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 22:29:16,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 22:29:16,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:16,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1538615469, now seen corresponding path program 1 times [2023-11-23 22:29:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908215018] [2023-11-23 22:29:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:29:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:29:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,683 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-23 22:29:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908215018] [2023-11-23 22:29:17,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908215018] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:17,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51291140] [2023-11-23 22:29:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:17,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:17,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:17,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:17,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:29:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-23 22:29:17,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:17,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 22:29:17,899 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 13 [2023-11-23 22:29:17,905 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 19 treesize of output 1 [2023-11-23 22:29:18,296 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 23 treesize of output 11 [2023-11-23 22:29:18,301 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 13 treesize of output 3 [2023-11-23 22:29:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 22:29:19,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:29:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 22:29:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51291140] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:29:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 28 [2023-11-23 22:29:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284036730] [2023-11-23 22:29:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:19,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:29:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:19,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:29:19,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-11-23 22:29:19,635 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 22:29:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:19,905 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-11-23 22:29:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 22:29:19,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 70 [2023-11-23 22:29:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:19,906 INFO L225 Difference]: With dead ends: 79 [2023-11-23 22:29:19,906 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 22:29:19,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 125 SyntacticMatches, 17 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2023-11-23 22:29:19,907 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:19,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 125 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:29:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 22:29:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 22:29:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 13 states have call successors, (13), 9 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-23 22:29:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-11-23 22:29:19,922 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 70 [2023-11-23 22:29:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:19,923 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-11-23 22:29:19,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 22:29:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-11-23 22:29:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 22:29:19,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:19,924 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-23 22:29:19,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 22:29:20,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 22:29:20,140 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:20,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2076293457, now seen corresponding path program 1 times [2023-11-23 22:29:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075010687] [2023-11-23 22:29:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:29:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:29:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,722 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-23 22:29:20,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075010687] [2023-11-23 22:29:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075010687] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678787923] [2023-11-23 22:29:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:20,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:20,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:20,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:20,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:29:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-23 22:29:20,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:21,057 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-23 22:29:21,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:29:21,265 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-23 22:29:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678787923] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:29:21,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:29:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2023-11-23 22:29:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184659301] [2023-11-23 22:29:21,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:29:21,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 22:29:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 22:29:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:29:21,268 INFO L87 Difference]: Start difference. First operand 68 states and 73 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-23 22:29:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:21,490 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-23 22:29:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:29:21,491 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-23 22:29:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:21,492 INFO L225 Difference]: With dead ends: 89 [2023-11-23 22:29:21,492 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 22:29:21,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 22:29:21,493 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:21,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 227 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:29:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 22:29:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-11-23 22:29:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.0) internal successors, (38), 38 states have internal predecessors, (38), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 22:29:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2023-11-23 22:29:21,507 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 70 [2023-11-23 22:29:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:21,508 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2023-11-23 22:29:21,508 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-23 22:29:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2023-11-23 22:29:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-23 22:29:21,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:29:21,509 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-23 22:29:21,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:29:21,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 22:29:21,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:29:21,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1060475130, now seen corresponding path program 1 times [2023-11-23 22:29:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487505448] [2023-11-23 22:29:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:29:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:29:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:29:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 22:29:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 22:29:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 22:29:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:29:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:29:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:29:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 22:29:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:29:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,430 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-23 22:29:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487505448] [2023-11-23 22:29:22,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487505448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:22,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:29:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12463174] [2023-11-23 22:29:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:22,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:29:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:29:22,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:29:22,434 INFO L87 Difference]: Start difference. First operand 59 states and 61 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-23 22:29:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:29:22,599 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-11-23 22:29:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:29:22,600 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-23 22:29:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:29:22,601 INFO L225 Difference]: With dead ends: 59 [2023-11-23 22:29:22,602 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 22:29:22,603 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-23 22:29:22,604 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:29:22,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:29:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 22:29:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 22:29:22,605 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-23 22:29:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 22:29:22,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-23 22:29:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:29:22,605 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 22:29:22,605 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-23 22:29:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 22:29:22,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 22:29:22,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 22:29:22,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 22:29:22,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 22:29:23,982 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2023-11-23 22:29:23,983 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2023-11-23 22:29:23,984 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2023-11-23 22:29:23,984 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2023-11-23 22:29:23,984 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 22:29:23,984 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 22:29:23,984 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 22:29:23,984 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 22:29:23,984 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2023-11-23 22:29:23,984 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 22:29:23,987 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1| Int)) (<= 2 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$#3.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 8) 0) (<= 1 .cse1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= .cse0 0)) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int)) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#3.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse2)))) (= (select (select |#memory_$Pointer$#3.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-23 22:29:23,993 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2023-11-23 22:29:23,994 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1| Int)) (<= 2 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$#3.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 8) 0) (<= 1 .cse1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret680#1| 1) (not (= .cse0 0)) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int)) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#3.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse2)))) (= (select (select |#memory_$Pointer$#3.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-23 22:29:23,994 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1| Int)) (<= 2 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$#3.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 8) 0) (<= 1 .cse1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= .cse0 0)) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int)) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#3.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse2)))) (= (select (select |#memory_$Pointer$#3.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-23 22:29:23,995 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret344#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 .cse1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 22:29:23,995 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2023-11-23 22:29:23,995 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 .cse1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 22:29:23,995 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 22:29:23,996 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1| Int)) (<= 2 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$#3.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 8) 0) (<= 1 .cse1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= .cse0 0)) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int)) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#3.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse2)))) (= (select (select |#memory_$Pointer$#3.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-23 22:29:23,996 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2023-11-23 22:29:23,997 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1| Int)) (<= 2 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_1|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_1|)))) (= (select (select |#memory_$Pointer$#3.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 8) 0) (<= 1 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret681#1| 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= .cse0 0)) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int)) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= (select (select |#memory_$Pointer$#3.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse2)))) (= (select (select |#memory_$Pointer$#3.offset| .cse0) 0) 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)))) [2023-11-23 22:29:23,997 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 .cse1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 22:29:23,997 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 .cse1) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 22:29:23,998 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#1.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|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (exists ((v_subst_1 Int)) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| v_subst_1) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse1) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem345#1.base| .cse1) (= (select (select |#memory_$Pointer$#3.base| .cse1) 0) v_subst_1)))) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 .cse2) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem345#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 22:29:23,998 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2023-11-23 22:29:23,998 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2023-11-23 22:29:23,998 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (let ((.cse0 (select (select |#memory_$Pointer$#3.base| .cse1) 0))) (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_~node#1.base|) (<= 2 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (<= 1 .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0)))) [2023-11-23 22:29:23,998 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2023-11-23 22:29:23,999 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (let ((.cse0 (select (select |#memory_$Pointer$#3.base| .cse1) 0))) (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_~node#1.base|) (<= 2 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (<= 1 .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$#3.offset| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) 0) 0)))) [2023-11-23 22:29:23,999 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 22:29:23,999 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 22:29:23,999 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 22:29:23,999 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 22:29:24,000 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 22:29:24,000 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 22:29:24,004 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:24,006 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:29:24,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:29:24 BoogieIcfgContainer [2023-11-23 22:29:24,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:29:24,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:29:24,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:29:24,017 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:29:24,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:53" (3/4) ... [2023-11-23 22:29:24,021 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 22:29:24,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-23 22:29:24,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-23 22:29:24,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 22:29:24,027 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 22:29:24,032 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-23 22:29:24,033 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-23 22:29:24,033 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 22:29:24,034 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 22:29:24,190 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 22:29:24,190 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/witness.yml [2023-11-23 22:29:24,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:29:24,191 INFO L158 Benchmark]: Toolchain (without parser) took 34983.28ms. Allocated memory was 136.3MB in the beginning and 457.2MB in the end (delta: 320.9MB). Free memory was 99.4MB in the beginning and 248.6MB in the end (delta: -149.2MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,192 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 136.3MB. Free memory was 95.6MB in the beginning and 95.5MB in the end (delta: 141.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:29:24,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3044.83ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 99.2MB in the beginning and 90.8MB in the end (delta: 8.4MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.34ms. Allocated memory is still 172.0MB. Free memory was 90.8MB in the beginning and 85.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,194 INFO L158 Benchmark]: Boogie Preprocessor took 70.87ms. Allocated memory is still 172.0MB. Free memory was 85.7MB in the beginning and 82.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,195 INFO L158 Benchmark]: RCFGBuilder took 666.09ms. Allocated memory is still 172.0MB. Free memory was 82.4MB in the beginning and 116.0MB in the end (delta: -33.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,195 INFO L158 Benchmark]: TraceAbstraction took 30894.28ms. Allocated memory was 172.0MB in the beginning and 457.2MB in the end (delta: 285.2MB). Free memory was 116.0MB in the beginning and 253.9MB in the end (delta: -137.9MB). Peak memory consumption was 147.3MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,198 INFO L158 Benchmark]: Witness Printer took 173.40ms. Allocated memory is still 457.2MB. Free memory was 253.9MB in the beginning and 248.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:29:24,208 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.24ms. Allocated memory is still 136.3MB. Free memory was 95.6MB in the beginning and 95.5MB in the end (delta: 141.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3044.83ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 99.2MB in the beginning and 90.8MB in the end (delta: 8.4MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.34ms. Allocated memory is still 172.0MB. Free memory was 90.8MB in the beginning and 85.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.87ms. Allocated memory is still 172.0MB. Free memory was 85.7MB in the beginning and 82.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 666.09ms. Allocated memory is still 172.0MB. Free memory was 82.4MB in the beginning and 116.0MB in the end (delta: -33.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30894.28ms. Allocated memory was 172.0MB in the beginning and 457.2MB in the end (delta: 285.2MB). Free memory was 116.0MB in the beginning and 253.9MB in the end (delta: -137.9MB). Peak memory consumption was 147.3MB. Max. memory is 16.1GB. * Witness Printer took 173.40ms. Allocated memory is still 457.2MB. Free memory was 253.9MB in the beginning and 248.6MB 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: 30.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 2992 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2374 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2286 IncrementalHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 618 mSDtfsCounter, 2286 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 560 SyntacticMatches, 36 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 87 PreInvPairs, 98 NumberOfFragments, 1083 HoareAnnotationTreeSize, 87 FomulaSimplifications, 949 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1396 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1138 ConstructedInterpolants, 125 QuantifiedInterpolants, 9614 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1202 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 690/754 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-23 22:29:24,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e52a990-43f5-4a35-bd57-eafc0ced6051/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE