./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:09:33,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:09:33,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 23:09:33,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:09:33,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:09:33,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:09:33,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:09:34,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:09:34,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:09:34,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:09:34,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:09:34,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:09:34,004 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:09:34,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:09:34,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:09:34,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:09:34,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:09:34,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:09:34,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:09:34,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:09:34,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:09:34,010 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:09:34,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:09:34,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:09:34,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:09:34,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:09:34,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:09:34,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:09:34,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:09:34,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:09:34,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:09:34,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:09:34,016 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:09:34,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:09:34,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:09:34,017 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:09:34,017 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_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/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_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2023-11-06 23:09:34,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:09:34,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:09:34,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:09:34,376 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:09:34,377 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:09:34,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2023-11-06 23:09:37,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:09:38,177 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:09:38,179 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2023-11-06 23:09:38,235 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/data/c8873f698/b1733a4ab7f94df0ad4030ef5cbccdca/FLAG66154cb1d [2023-11-06 23:09:38,256 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/data/c8873f698/b1733a4ab7f94df0ad4030ef5cbccdca [2023-11-06 23:09:38,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:09:38,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:09:38,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:09:38,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:09:38,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:09:38,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:09:38" (1/1) ... [2023-11-06 23:09:38,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba730cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:38, skipping insertion in model container [2023-11-06 23:09:38,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:09:38" (1/1) ... [2023-11-06 23:09:38,430 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:09:38,747 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_b38b06da-de42-45d7-96cb-8680e5822c41/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2023-11-06 23:09:38,756 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_b38b06da-de42-45d7-96cb-8680e5822c41/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2023-11-06 23:09:39,987 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:39,988 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:39,989 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:39,990 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:39,992 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:40,008 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:40,009 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:40,012 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:40,013 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:40,621 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 23:09:40,623 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 23:09:40,624 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 23:09:40,626 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 23:09:40,628 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 23:09:40,628 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 23:09:40,629 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 23:09:40,630 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 23:09:40,631 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 23:09:40,632 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 23:09:41,045 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,045 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:09:41,207 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:09:41,223 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_b38b06da-de42-45d7-96cb-8680e5822c41/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2023-11-06 23:09:41,224 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_b38b06da-de42-45d7-96cb-8680e5822c41/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2023-11-06 23:09:41,286 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,287 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,287 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,288 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,290 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,297 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,298 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,299 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,300 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,334 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 23:09:41,335 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 23:09:41,336 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 23:09:41,338 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 23:09:41,339 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 23:09:41,340 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 23:09:41,340 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 23:09:41,341 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 23:09:41,342 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 23:09:41,342 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 23:09:41,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-06 23:09:41,481 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,482 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 23:09:41,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-06 23:09:41,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:09:41,786 WARN L672 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,786 WARN L672 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,786 WARN L672 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,786 WARN L672 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,787 WARN L672 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,787 WARN L672 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,787 WARN L672 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,787 WARN L672 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,787 WARN L672 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,788 WARN L672 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,788 WARN L672 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,788 WARN L672 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,788 WARN L672 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,788 WARN L672 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,789 WARN L672 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,789 WARN L672 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,789 WARN L672 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,789 WARN L672 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:41,797 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:09:41,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41 WrapperNode [2023-11-06 23:09:41,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:09:41,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:09:41,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:09:41,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:09:41,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:41,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:41,998 INFO L138 Inliner]: procedures = 689, calls = 2612, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 776 [2023-11-06 23:09:41,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:09:42,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:09:42,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:09:42,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:09:42,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:09:42,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:09:42,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:09:42,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:09:42,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (1/1) ... [2023-11-06 23:09:42,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:09:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:09:42,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:09:42,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:09:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-06 23:09:42,216 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-06 23:09:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:09:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:09:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 23:09:42,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 23:09:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:09:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:09:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:09:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:09:42,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:09:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-06 23:09:42,221 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-06 23:09:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:09:42,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:09:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:09:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:09:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 23:09:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-06 23:09:42,223 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-06 23:09:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:09:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:09:42,554 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:09:42,557 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:09:43,876 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:09:43,892 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:09:43,893 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:09:43,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:43 BoogieIcfgContainer [2023-11-06 23:09:43,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:09:43,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:09:43,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:09:43,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:09:43,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:09:38" (1/3) ... [2023-11-06 23:09:43,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ebe0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:43, skipping insertion in model container [2023-11-06 23:09:43,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:41" (2/3) ... [2023-11-06 23:09:43,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ebe0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:43, skipping insertion in model container [2023-11-06 23:09:43,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:43" (3/3) ... [2023-11-06 23:09:43,909 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2023-11-06 23:09:43,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:09:43,931 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:09:44,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:09:44,020 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=LoopsAndPotentialCycles, 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;@5d0322da, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:09:44,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:09:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:09:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 23:09:44,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:44,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:44,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:44,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2023-11-06 23:09:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015542805] [2023-11-06 23:09:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015542805] [2023-11-06 23:09:44,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015542805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:44,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:44,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:09:44,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356257563] [2023-11-06 23:09:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:09:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:09:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:09:44,928 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 23:09:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:45,239 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2023-11-06 23:09:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:09:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-11-06 23:09:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:45,252 INFO L225 Difference]: With dead ends: 117 [2023-11-06 23:09:45,253 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 23:09:45,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:09:45,267 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:45,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 62 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:09:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 23:09:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-06 23:09:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 23:09:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2023-11-06 23:09:45,326 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2023-11-06 23:09:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:45,330 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2023-11-06 23:09:45,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 23:09:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2023-11-06 23:09:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 23:09:45,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:45,336 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, 1, 1, 1, 1] [2023-11-06 23:09:45,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:09:45,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:45,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2023-11-06 23:09:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388360990] [2023-11-06 23:09:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:46,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388360990] [2023-11-06 23:09:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388360990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:09:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332211487] [2023-11-06 23:09:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:46,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:09:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:09:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:09:46,224 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 23:09:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:46,497 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2023-11-06 23:09:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:09:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-11-06 23:09:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:46,500 INFO L225 Difference]: With dead ends: 99 [2023-11-06 23:09:46,501 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 23:09:46,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:09:46,503 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:46,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 91 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:09:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 23:09:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 23:09:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 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-06 23:09:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-06 23:09:46,521 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2023-11-06 23:09:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:46,522 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-06 23:09:46,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 23:09:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-06 23:09:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 23:09:46,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:46,525 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:46,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:09:46,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:46,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2023-11-06 23:09:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632081110] [2023-11-06 23:09:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:47,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632081110] [2023-11-06 23:09:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632081110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:09:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616860391] [2023-11-06 23:09:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:47,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:09:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:47,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:09:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:09:47,716 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:48,170 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-11-06 23:09:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:09:48,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-06 23:09:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:48,172 INFO L225 Difference]: With dead ends: 69 [2023-11-06 23:09:48,172 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 23:09:48,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:09:48,174 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:48,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 200 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:09:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 23:09:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-11-06 23:09:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 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-06 23:09:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2023-11-06 23:09:48,196 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2023-11-06 23:09:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:48,196 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2023-11-06 23:09:48,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2023-11-06 23:09:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 23:09:48,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:48,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:48,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:09:48,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:48,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2023-11-06 23:09:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999442031] [2023-11-06 23:09:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:50,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999442031] [2023-11-06 23:09:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999442031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:50,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:50,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:09:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977269839] [2023-11-06 23:09:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:50,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:09:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:50,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:09:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:09:50,260 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 23:09:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:50,882 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2023-11-06 23:09:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:09:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2023-11-06 23:09:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:50,885 INFO L225 Difference]: With dead ends: 127 [2023-11-06 23:09:50,885 INFO L226 Difference]: Without dead ends: 78 [2023-11-06 23:09:50,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:09:50,890 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:50,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 200 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:09:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-06 23:09:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2023-11-06 23:09:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 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-06 23:09:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-11-06 23:09:50,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2023-11-06 23:09:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:50,913 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-11-06 23:09:50,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 23:09:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-11-06 23:09:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 23:09:50,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:50,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:50,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:09:50,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:50,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2023-11-06 23:09:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351066201] [2023-11-06 23:09:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:52,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:52,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351066201] [2023-11-06 23:09:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351066201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:09:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615161868] [2023-11-06 23:09:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:52,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:09:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:09:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:09:52,977 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:53,252 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2023-11-06 23:09:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:09:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-11-06 23:09:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:53,254 INFO L225 Difference]: With dead ends: 121 [2023-11-06 23:09:53,254 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 23:09:53,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:09:53,256 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:53,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 93 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:09:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 23:09:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-06 23:09:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 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-06 23:09:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2023-11-06 23:09:53,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2023-11-06 23:09:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:53,267 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2023-11-06 23:09:53,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2023-11-06 23:09:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:09:53,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:53,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:53,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:09:53,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:53,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2023-11-06 23:09:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149283865] [2023-11-06 23:09:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149283865] [2023-11-06 23:09:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149283865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:09:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742469842] [2023-11-06 23:09:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:09:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:09:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:09:54,431 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:54,918 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2023-11-06 23:09:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:09:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-11-06 23:09:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:54,920 INFO L225 Difference]: With dead ends: 82 [2023-11-06 23:09:54,921 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 23:09:54,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:09:54,922 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:54,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 254 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:09:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 23:09:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2023-11-06 23:09:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 51 states have internal predecessors, (53), 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-06 23:09:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2023-11-06 23:09:54,940 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2023-11-06 23:09:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:54,941 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2023-11-06 23:09:54,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2023-11-06 23:09:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:09:54,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:54,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:09:54,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:54,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2023-11-06 23:09:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522807836] [2023-11-06 23:09:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:56,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:09:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522807836] [2023-11-06 23:09:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522807836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:56,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:56,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 23:09:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705847393] [2023-11-06 23:09:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:56,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:09:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:09:56,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:09:56,727 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:57,455 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2023-11-06 23:09:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:09:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-11-06 23:09:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:57,458 INFO L225 Difference]: With dead ends: 81 [2023-11-06 23:09:57,458 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 23:09:57,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:09:57,459 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:57,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 298 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:09:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 23:09:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2023-11-06 23:09:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-06 23:09:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-11-06 23:09:57,471 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2023-11-06 23:09:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:57,472 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-11-06 23:09:57,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:09:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-11-06 23:09:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 23:09:57,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:57,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:57,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:09:57,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:57,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2023-11-06 23:09:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139582846] [2023-11-06 23:09:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:09:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:09:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 23:09:57,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139582846] [2023-11-06 23:09:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139582846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:09:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210317642] [2023-11-06 23:09:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:09:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:09:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:09:57,997 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 23:09:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:58,207 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2023-11-06 23:09:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:09:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-11-06 23:09:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:58,209 INFO L225 Difference]: With dead ends: 91 [2023-11-06 23:09:58,210 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 23:09:58,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:09:58,211 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:58,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:09:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 23:09:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 23:09:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-06 23:09:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2023-11-06 23:09:58,219 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2023-11-06 23:09:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:58,220 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2023-11-06 23:09:58,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 23:09:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2023-11-06 23:09:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:09:58,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:58,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:58,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:09:58,222 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:58,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2023-11-06 23:09:58,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:58,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837667570] [2023-11-06 23:09:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:09:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:09:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:09:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:09:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:09:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:09:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:09:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837667570] [2023-11-06 23:09:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837667570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:59,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:09:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004456959] [2023-11-06 23:09:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:59,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:09:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:09:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:09:59,081 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 23:09:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:59,426 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2023-11-06 23:09:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:09:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-06 23:09:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:59,428 INFO L225 Difference]: With dead ends: 75 [2023-11-06 23:09:59,428 INFO L226 Difference]: Without dead ends: 73 [2023-11-06 23:09:59,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:09:59,429 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:59,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 200 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:09:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-06 23:09:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2023-11-06 23:09:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-06 23:09:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-11-06 23:09:59,445 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2023-11-06 23:09:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:59,446 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-11-06 23:09:59,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 23:09:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-11-06 23:09:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 23:09:59,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:59,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:59,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:09:59,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:09:59,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:59,466 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2023-11-06 23:09:59,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:59,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536437181] [2023-11-06 23:09:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:59,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:10:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:10:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:10:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536437181] [2023-11-06 23:10:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536437181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:02,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010553008] [2023-11-06 23:10:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:02,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:02,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:02,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:10:02,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:10:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:02,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 2416 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 23:10:02,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:03,017 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-06 23:10:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 23:10:18,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:10:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010553008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:10:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 24 [2023-11-06 23:10:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167381939] [2023-11-06 23:10:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:18,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:10:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:10:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=482, Unknown=4, NotChecked=0, Total=552 [2023-11-06 23:10:18,492 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 23:10:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:20,372 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2023-11-06 23:10:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:10:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2023-11-06 23:10:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:20,374 INFO L225 Difference]: With dead ends: 97 [2023-11-06 23:10:20,374 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 23:10:20,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=128, Invalid=924, Unknown=4, NotChecked=0, Total=1056 [2023-11-06 23:10:20,376 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:20,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 23:10:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 23:10:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-06 23:10:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-06 23:10:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2023-11-06 23:10:20,388 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 50 [2023-11-06 23:10:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:20,389 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2023-11-06 23:10:20,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 23:10:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2023-11-06 23:10:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 23:10:20,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:20,390 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:20,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 23:10:20,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 23:10:20,602 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:20,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2023-11-06 23:10:20,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:20,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429974322] [2023-11-06 23:10:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:10:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:10:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 23:10:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 23:10:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429974322] [2023-11-06 23:10:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429974322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:10:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345918557] [2023-11-06 23:10:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:22,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:10:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:10:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:10:22,154 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 23:10:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:22,594 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-11-06 23:10:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:10:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 52 [2023-11-06 23:10:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:22,596 INFO L225 Difference]: With dead ends: 73 [2023-11-06 23:10:22,596 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 23:10:22,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:10:22,597 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:22,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 134 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:10:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 23:10:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-06 23:10:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.0625) internal successors, (51), 50 states have internal predecessors, (51), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-06 23:10:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2023-11-06 23:10:22,618 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 52 [2023-11-06 23:10:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:22,619 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2023-11-06 23:10:22,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 23:10:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2023-11-06 23:10:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 23:10:22,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:22,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:22,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:10:22,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:22,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2023-11-06 23:10:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:22,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164841980] [2023-11-06 23:10:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:22,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:10:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:10:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:23,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164841980] [2023-11-06 23:10:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164841980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:23,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:10:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582919337] [2023-11-06 23:10:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:23,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:10:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:10:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:10:23,751 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 23:10:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:24,222 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-11-06 23:10:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:10:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-06 23:10:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:24,224 INFO L225 Difference]: With dead ends: 85 [2023-11-06 23:10:24,224 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 23:10:24,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:10:24,225 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:24,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 254 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:10:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 23:10:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-11-06 23:10:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-06 23:10:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-11-06 23:10:24,240 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 52 [2023-11-06 23:10:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:24,241 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-11-06 23:10:24,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 23:10:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-11-06 23:10:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 23:10:24,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:24,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:24,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:10:24,243 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:24,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2023-11-06 23:10:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096254444] [2023-11-06 23:10:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:10:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:10:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:25,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096254444] [2023-11-06 23:10:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096254444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:25,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:25,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 23:10:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951459509] [2023-11-06 23:10:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:25,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:10:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:10:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:10:25,775 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 23:10:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:26,446 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-11-06 23:10:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 23:10:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-06 23:10:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:26,448 INFO L225 Difference]: With dead ends: 83 [2023-11-06 23:10:26,448 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 23:10:26,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-11-06 23:10:26,449 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:26,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 298 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:10:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 23:10:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2023-11-06 23:10:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 12 states have call successors, (12), 8 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-06 23:10:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2023-11-06 23:10:26,464 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 52 [2023-11-06 23:10:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:26,465 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2023-11-06 23:10:26,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 23:10:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2023-11-06 23:10:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 23:10:26,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:26,466 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:26,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:10:26,466 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:26,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2023-11-06 23:10:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:26,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410746741] [2023-11-06 23:10:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:10:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:10:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 23:10:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:10:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 23:10:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410746741] [2023-11-06 23:10:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410746741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 23:10:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854590668] [2023-11-06 23:10:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 23:10:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 23:10:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:10:28,553 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 23:10:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:29,110 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-06 23:10:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:10:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2023-11-06 23:10:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:29,111 INFO L225 Difference]: With dead ends: 72 [2023-11-06 23:10:29,111 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 23:10:29,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:10:29,113 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:29,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 157 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:10:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 23:10:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-06 23:10:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 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-06 23:10:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-11-06 23:10:29,127 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 59 [2023-11-06 23:10:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:29,127 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-11-06 23:10:29,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 23:10:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-11-06 23:10:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 23:10:29,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:29,131 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:29,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:10:29,132 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:29,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2023-11-06 23:10:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726746016] [2023-11-06 23:10:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:30,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:10:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:10:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 23:10:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 23:10:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 23:10:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 23:10:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 23:10:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 23:10:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726746016] [2023-11-06 23:10:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726746016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258862784] [2023-11-06 23:10:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:31,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:31,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:10:31,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:10:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 23:10:31,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:31,721 INFO L351 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-06 23:10:32,728 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 23:10:32,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2023-11-06 23:10:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:10:32,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:10:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258862784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:33,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:10:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2023-11-06 23:10:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621414696] [2023-11-06 23:10:33,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:10:33,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 23:10:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:33,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 23:10:33,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:10:33,051 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-06 23:10:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:34,957 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2023-11-06 23:10:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 23:10:34,958 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) Word has length 76 [2023-11-06 23:10:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:34,959 INFO L225 Difference]: With dead ends: 162 [2023-11-06 23:10:34,959 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 23:10:34,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2023-11-06 23:10:34,961 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 94 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:34,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 179 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 23:10:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 23:10:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 23:10:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 23:10:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-11-06 23:10:34,974 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 76 [2023-11-06 23:10:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:34,975 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-11-06 23:10:34,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-06 23:10:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-11-06 23:10:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 23:10:34,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:34,977 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:34,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:10:35,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 23:10:35,186 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:35,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash 998538037, now seen corresponding path program 1 times [2023-11-06 23:10:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851205932] [2023-11-06 23:10:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 23:10:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:10:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:10:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:10:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 23:10:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 23:10:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 23:10:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 23:10:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851205932] [2023-11-06 23:10:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851205932] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126547655] [2023-11-06 23:10:36,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:36,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:36,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:10:36,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:10:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:37,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 23:10:37,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-06 23:10:37,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:10:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126547655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:10:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-11-06 23:10:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62404076] [2023-11-06 23:10:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:37,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:37,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:37,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:37,642 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 23:10:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:37,968 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2023-11-06 23:10:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 88 [2023-11-06 23:10:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:37,970 INFO L225 Difference]: With dead ends: 128 [2023-11-06 23:10:37,970 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 23:10:37,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:10:37,975 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:37,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:10:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 23:10:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 23:10:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.0) internal successors, (50), 50 states have internal predecessors, (50), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 23:10:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2023-11-06 23:10:37,989 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 88 [2023-11-06 23:10:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:37,989 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-06 23:10:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 23:10:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2023-11-06 23:10:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 23:10:37,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:37,991 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:38,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 23:10:38,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 23:10:38,201 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:38,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2023-11-06 23:10:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249656441] [2023-11-06 23:10:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:10:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:10:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:10:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 23:10:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 23:10:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:10:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:10:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:10:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 23:10:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 23:10:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 23:10:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-06 23:10:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249656441] [2023-11-06 23:10:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249656441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 23:10:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337085924] [2023-11-06 23:10:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:10:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:10:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:10:41,602 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-06 23:10:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,235 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2023-11-06 23:10:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:10:42,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2023-11-06 23:10:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,237 INFO L225 Difference]: With dead ends: 72 [2023-11-06 23:10:42,237 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:10:42,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:10:42,238 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 175 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:10:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:10:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:10:42,240 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-06 23:10:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:10:42,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2023-11-06 23:10:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,240 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:10:42,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-06 23:10:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:10:42,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:10:42,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:10:42,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:10:42,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:10:54,576 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2023-11-06 23:10:54,577 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 8) .cse0)) (= .cse0 0)))) (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3| Int)) (< (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2023-11-06 23:10:54,577 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-06 23:10:54,577 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-06 23:10:54,578 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 8) .cse0)) (= .cse0 0)))) (forall ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3| Int)) (< (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2023-11-06 23:10:54,578 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-06 23:10:54,578 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-06 23:10:54,578 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-06 23:10:54,578 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-06 23:10:54,579 INFO L899 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,579 INFO L899 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,579 INFO L899 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,579 INFO L899 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,579 INFO L899 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,579 INFO L899 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,580 INFO L899 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,580 INFO L899 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,580 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7384 7388) the Hoare annotation is: true [2023-11-06 23:10:54,580 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2023-11-06 23:10:54,580 INFO L899 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,580 INFO L899 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2023-11-06 23:10:54,581 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2023-11-06 23:10:54,581 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-06 23:10:54,581 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2023-11-06 23:10:54,581 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-06 23:10:54,581 INFO L899 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2023-11-06 23:10:54,581 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:10:54,582 INFO L895 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0))) (.cse8 (not (= .cse6 0)))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse5 (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse7 .cse8 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 0)) (and .cse0 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse5 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))))))) [2023-11-06 23:10:54,582 INFO L895 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 0)) (not (= .cse0 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) 8) 0))) [2023-11-06 23:10:54,582 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-06 23:10:54,583 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2023-11-06 23:10:54,583 INFO L899 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2023-11-06 23:10:54,583 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-06 23:10:54,583 INFO L895 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse0 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 8) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3| Int)) (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))))) [2023-11-06 23:10:54,584 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8)) (.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0))) (let ((.cse1 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse8)) (.cse10 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse12 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse12 0)) (= .cse11 .cse12))))) (.cse0 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (let ((.cse2 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse3 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (and (or (not .cse0) (and .cse1 .cse2) (not .cse3)) .cse4 .cse5 (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse6 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse7 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| .cse7)))) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (<= .cse8 (* 18446744073709551616 (div .cse8 18446744073709551616))) .cse9 .cse10 (or (not .cse1) (not .cse2) (and .cse3 .cse0)))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 (= .cse11 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse4 .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse9 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) .cse10 .cse0)))) [2023-11-06 23:10:54,584 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:10:54,584 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 8974) the Hoare annotation is: true [2023-11-06 23:10:54,585 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1217#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0))) (.cse6 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse8 0)) (= .cse7 .cse8)))))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse4 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| .cse4)))) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse6) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse5 .cse6)))) [2023-11-06 23:10:54,585 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-06 23:10:54,585 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2023-11-06 23:10:54,586 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse1 0)) (= .cse0 .cse1)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-06 23:10:54,586 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:10:54,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:10:54,586 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-06 23:10:54,586 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2023-11-06 23:10:54,587 INFO L895 garLoopResultBuilder]: At program point aws_byte_cursor_from_array_returnLabel#1(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse3 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse7 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| .cse7))))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse5 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse6 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse6 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 8) .cse6)))))) (or (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10|) 0) |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) .cse0 .cse1 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse2 .cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse4 .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616)))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse4 .cse5))) [2023-11-06 23:10:54,587 INFO L899 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2023-11-06 23:10:54,587 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_#t~mem594#1| |ULTIMATE.start_assert_bytes_match_#t~mem593#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse1 0)) (= .cse0 .cse1)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-06 23:10:54,587 INFO L895 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse0 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1|) 8) .cse0)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3| Int)) (<= 0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_BEFORE_CALL_3|) 0))) (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1))))) [2023-11-06 23:10:54,588 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse1 0)) (= .cse0 .cse1)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2023-11-06 23:10:54,588 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0))) (.cse5 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse7 0)) (= .cse0 .cse7)))))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse1 .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse4 .cse5) (and .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse6 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse6 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| .cse6)))) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse4 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse5)))) [2023-11-06 23:10:54,588 INFO L899 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2023-11-06 23:10:54,589 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 0))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1216#1| 1)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse5)) (.cse7 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse9 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse9 0)) (= .cse8 .cse9)))))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8| Int)) (let ((.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8| 8)))) (and (not (= .cse4 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| .cse4)))) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616))) .cse6 .cse7) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) 8) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse6 .cse7)))) [2023-11-06 23:10:54,589 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2023-11-06 23:10:54,589 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-06 23:10:54,589 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-06 23:10:54,589 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-06 23:10:54,590 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-06 23:10:54,590 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-06 23:10:54,590 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-06 23:10:54,590 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-06 23:10:54,593 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:54,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:10:54,606 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10 : int :: #memory_int[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10][0] == #res!len) could not be translated [2023-11-06 23:10:54,610 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:54,619 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,620 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,620 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,620 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:54,621 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,621 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,621 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:10:54,623 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,623 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_cursor_from_array_#res#1.ptr [2023-11-06 23:10:54,623 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,623 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,625 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10 : int :: #memory_int[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10][0] == #res!len) could not be translated [2023-11-06 23:10:54,629 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:54,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:54,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:10:54,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_cursor_from_array_#res#1.ptr [2023-11-06 23:10:54,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:54,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:54,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:10:54 BoogieIcfgContainer [2023-11-06 23:10:54,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:10:54,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:10:54,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:10:54,634 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:10:54,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:43" (3/4) ... [2023-11-06 23:10:54,637 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:10:54,641 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-06 23:10:54,641 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2023-11-06 23:10:54,642 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-06 23:10:54,642 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 23:10:54,642 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-06 23:10:54,666 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 115 nodes and edges [2023-11-06 23:10:54,670 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2023-11-06 23:10:54,672 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-11-06 23:10:54,673 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 23:10:54,675 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 23:10:54,677 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:10:54,678 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 23:10:54,680 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:10:55,417 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:10:55,418 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:10:55,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:10:55,419 INFO L158 Benchmark]: Toolchain (without parser) took 77151.54ms. Allocated memory was 144.7MB in the beginning and 734.0MB in the end (delta: 589.3MB). Free memory was 105.4MB in the beginning and 395.9MB in the end (delta: -290.5MB). Peak memory consumption was 299.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,420 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:55,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3527.43ms. Allocated memory was 144.7MB in the beginning and 178.3MB in the end (delta: 33.6MB). Free memory was 105.1MB in the beginning and 111.6MB in the end (delta: -6.6MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.47ms. Allocated memory is still 178.3MB. Free memory was 111.6MB in the beginning and 100.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,421 INFO L158 Benchmark]: Boogie Preprocessor took 117.81ms. Allocated memory is still 178.3MB. Free memory was 100.0MB in the beginning and 93.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,421 INFO L158 Benchmark]: RCFGBuilder took 1777.58ms. Allocated memory is still 178.3MB. Free memory was 93.7MB in the beginning and 69.9MB in the end (delta: 23.8MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,422 INFO L158 Benchmark]: TraceAbstraction took 70735.49ms. Allocated memory was 178.3MB in the beginning and 734.0MB in the end (delta: 555.7MB). Free memory was 68.8MB in the beginning and 525.9MB in the end (delta: -457.1MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,422 INFO L158 Benchmark]: Witness Printer took 784.35ms. Allocated memory is still 734.0MB. Free memory was 525.9MB in the beginning and 395.9MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2023-11-06 23:10:55,424 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.72ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3527.43ms. Allocated memory was 144.7MB in the beginning and 178.3MB in the end (delta: 33.6MB). Free memory was 105.1MB in the beginning and 111.6MB in the end (delta: -6.6MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.47ms. Allocated memory is still 178.3MB. Free memory was 111.6MB in the beginning and 100.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.81ms. Allocated memory is still 178.3MB. Free memory was 100.0MB in the beginning and 93.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1777.58ms. Allocated memory is still 178.3MB. Free memory was 93.7MB in the beginning and 69.9MB in the end (delta: 23.8MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * TraceAbstraction took 70735.49ms. Allocated memory was 178.3MB in the beginning and 734.0MB in the end (delta: 555.7MB). Free memory was 68.8MB in the beginning and 525.9MB in the end (delta: -457.1MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 784.35ms. Allocated memory is still 734.0MB. Free memory was 525.9MB in the beginning and 395.9MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8269]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] - GenericResultAtLocation [Line: 8755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10 : int :: #memory_int[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10][0] == #res!len) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_cursor_from_array_#res#1.ptr - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10 : int :: #memory_int[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10][0] == #res!len) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_cursor_from_array_#res#1.ptr - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated * 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 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 887 mSDsluCounter, 3175 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2578 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5361 IncrementalHoareTripleChecker+Invalid, 5678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 597 mSDtfsCounter, 5361 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 750 GetRequests, 475 SyntacticMatches, 16 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=12, InterpolantAutomatonStates: 180, 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, 17 MinimizatonAttempts, 61 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 94 PreInvPairs, 115 NumberOfFragments, 1424 HoareAnnotationTreeSize, 94 FomulaSimplifications, 179 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1498 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1034 ConstructedInterpolants, 51 QuantifiedInterpolants, 4184 SizeOfPredicates, 32 NumberOfNonLiveVariables, 7430 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 385/425 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 - InvariantResult [Line: 8251]: Loop Invariant [2023-11-06 23:10:55,441 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10 : int :: #memory_int[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10][0] == #res!len) could not be translated [2023-11-06 23:10:55,442 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:55,442 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,442 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,442 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,443 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:55,443 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,443 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,443 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:10:55,443 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,444 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_cursor_from_array_#res#1.ptr [2023-11-06 23:10:55,444 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,444 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,445 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10 : int :: #memory_int[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_10][0] == #res!len) could not be translated [2023-11-06 23:10:55,446 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:55,446 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,446 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,447 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,447 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 23:10:55,447 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,447 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,447 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 23:10:55,448 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && aws_byte_cursor_from_array_#res#1.ptr.base == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated [2023-11-06 23:10:55,448 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_cursor_from_array_#res#1.ptr [2023-11-06 23:10:55,448 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_cursor_from_array_#res#1.ptr.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 23:10:55,448 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8 : int :: !(#memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base_BEFORE_CALL_1][8] == #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_8][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_8 + 8]) could not be translated Derived loop invariant: (((((!((0 == bytes)) && !((cur == 0))) && !((array == 0))) && (len == length)) && (length <= (18446744073709551616 * (length / 18446744073709551616)))) || ((!((cur == 0)) && (array == bytes)) && (len == length))) - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 23:10:55,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38b06da-de42-45d7-96cb-8680e5822c41/bin/uautomizer-verify-WvqO1wxjHP/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