./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 f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX --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.1-dev-f8e1c90 [2021-11-09 09:09:02,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:09:02,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:09:02,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:09:02,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:09:02,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:09:02,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:09:02,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:09:02,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:09:02,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:09:02,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:09:02,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:09:02,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:09:02,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:09:02,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:09:02,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:09:02,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:09:02,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:09:02,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:09:02,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:09:02,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:09:02,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:09:02,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:09:02,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:09:02,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:09:02,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:09:02,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:09:02,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:09:02,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:09:02,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:09:02,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:09:02,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:09:02,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:09:02,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:09:02,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:09:02,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:09:02,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:09:02,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:09:02,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:09:02,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:09:02,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:09:02,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-09 09:09:02,484 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:09:02,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:09:02,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:09:02,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:09:02,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:09:02,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:09:02,488 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:09:02,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:09:02,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:09:02,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:09:02,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:09:02,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:09:02,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:09:02,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:09:02,492 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:09:02,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:09:02,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:09:02,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:09:02,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:09:02,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:09:02,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:09:02,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:09:02,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:09:02,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:09:02,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:09:02,494 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:09:02,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:09:02,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:09:02,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:09:02,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX 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 [2021-11-09 09:09:02,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:09:02,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:09:02,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:09:02,907 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:09:02,909 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:09:02,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-09 09:09:03,005 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/data/4c46498af/f173b144819c477598a0a0fe2f0664f6/FLAG878ca873e [2021-11-09 09:09:04,029 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:09:04,030 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-09 09:09:04,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/data/4c46498af/f173b144819c477598a0a0fe2f0664f6/FLAG878ca873e [2021-11-09 09:09:04,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/data/4c46498af/f173b144819c477598a0a0fe2f0664f6 [2021-11-09 09:09:04,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:09:04,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:09:04,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:09:04,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:09:04,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:09:04,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:09:04" (1/1) ... [2021-11-09 09:09:04,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e5a053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:04, skipping insertion in model container [2021-11-09 09:09:04,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:09:04" (1/1) ... [2021-11-09 09:09:04,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:09:04,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:09:04,882 WARN L228 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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-11-09 09:09:04,890 WARN L228 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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-11-09 09:09:04,917 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-09 09:09:04,924 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-09 09:09:05,947 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,948 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,949 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,950 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,952 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,970 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,971 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:05,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:06,411 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-09 09:09:06,414 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-09 09:09:06,415 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-09 09:09:06,416 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-09 09:09:06,418 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-09 09:09:06,419 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-09 09:09:06,420 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-09 09:09:06,421 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-09 09:09:06,422 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-09 09:09:06,422 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-09 09:09:06,681 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-09 09:09:06,769 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:06,770 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:06,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:09:06,908 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:09:06,934 WARN L228 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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-11-09 09:09:06,948 WARN L228 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_3633f12a-b7a1-4d12-adb3-e6601bc418e8/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-11-09 09:09:06,950 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-09 09:09:06,950 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-09 09:09:07,037 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,038 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,038 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,039 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,039 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,053 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,054 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,058 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,059 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,124 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-09 09:09:07,125 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-09 09:09:07,126 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-09 09:09:07,127 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-09 09:09:07,128 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-09 09:09:07,129 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-09 09:09:07,130 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-09 09:09:07,131 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-09 09:09:07,131 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-09 09:09:07,134 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-09 09:09:07,173 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-09 09:09:07,261 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,261 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:09:07,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:09:07,643 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:09:07,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07 WrapperNode [2021-11-09 09:09:07,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:09:07,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:09:07,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:09:07,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:09:07,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:07,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:07,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:09:07,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:09:07,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:09:07,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:09:07,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:07,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:07,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:07,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:08,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:08,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:08,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:08,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:09:08,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:09:08,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:09:08,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:09:08,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (1/1) ... [2021-11-09 09:09:08,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:09:08,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:09:08,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:09:08,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:09:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 09:09:08,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 09:09:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 09:09:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 09:09:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:09:08,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:09:08,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:09:08,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 09:09:08,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-09 09:09:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:09:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:09:19,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:09:19,481 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-11-09 09:09:19,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:09:19 BoogieIcfgContainer [2021-11-09 09:09:19,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:09:19,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:09:19,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:09:19,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:09:19,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:09:04" (1/3) ... [2021-11-09 09:09:19,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcaf0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:09:19, skipping insertion in model container [2021-11-09 09:09:19,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:07" (2/3) ... [2021-11-09 09:09:19,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcaf0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:09:19, skipping insertion in model container [2021-11-09 09:09:19,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:09:19" (3/3) ... [2021-11-09 09:09:19,494 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-09 09:09:19,500 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:09:19,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-09 09:09:19,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:09:19,564 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:09:19,564 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-09 09:09:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 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) [2021-11-09 09:09:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-09 09:09:19,589 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:19,590 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:19,591 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2021-11-09 09:09:19,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:19,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984112385] [2021-11-09 09:09:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:19,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:20,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:20,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984112385] [2021-11-09 09:09:20,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984112385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:20,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:20,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:09:20,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541185340] [2021-11-09 09:09:20,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-09 09:09:20,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-09 09:09:20,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 09:09:20,531 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2021-11-09 09:09:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:20,560 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-09 09:09:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-09 09:09:20,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2021-11-09 09:09:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:20,574 INFO L225 Difference]: With dead ends: 117 [2021-11-09 09:09:20,574 INFO L226 Difference]: Without dead ends: 53 [2021-11-09 09:09:20,578 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 09:09:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-09 09:09:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-09 09:09:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 52 states have internal predecessors, (62), 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) [2021-11-09 09:09:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-09 09:09:20,641 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2021-11-09 09:09:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:20,642 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-09 09:09:20,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2021-11-09 09:09:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-09 09:09:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-09 09:09:20,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:20,644 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:20,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:09:20,644 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2021-11-09 09:09:20,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:20,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435145432] [2021-11-09 09:09:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:20,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:21,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:21,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435145432] [2021-11-09 09:09:21,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435145432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:21,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:21,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:21,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843846899] [2021-11-09 09:09:21,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:09:21,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:21,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:21,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:21,031 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-09 09:09:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:21,081 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2021-11-09 09:09:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-11-09 09:09:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:21,083 INFO L225 Difference]: With dead ends: 90 [2021-11-09 09:09:21,084 INFO L226 Difference]: Without dead ends: 53 [2021-11-09 09:09:21,085 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-09 09:09:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-09 09:09:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 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) [2021-11-09 09:09:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-11-09 09:09:21,092 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2021-11-09 09:09:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:21,093 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-11-09 09:09:21,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-09 09:09:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-11-09 09:09:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-09 09:09:21,094 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:21,094 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:21,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:09:21,095 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2021-11-09 09:09:21,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:21,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779688478] [2021-11-09 09:09:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:21,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:21,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:21,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779688478] [2021-11-09 09:09:21,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779688478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:21,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:21,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:09:21,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775012306] [2021-11-09 09:09:21,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:09:21,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:09:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:09:22,001 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2021-11-09 09:09:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:22,616 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2021-11-09 09:09:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:09:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 14 [2021-11-09 09:09:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:22,620 INFO L225 Difference]: With dead ends: 97 [2021-11-09 09:09:22,620 INFO L226 Difference]: Without dead ends: 93 [2021-11-09 09:09:22,620 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:09:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-09 09:09:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2021-11-09 09:09:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 60 states have internal predecessors, (69), 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) [2021-11-09 09:09:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2021-11-09 09:09:22,637 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2021-11-09 09:09:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:22,639 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-11-09 09:09:22,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) [2021-11-09 09:09:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2021-11-09 09:09:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-09 09:09:22,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:22,641 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:22,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:09:22,642 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2021-11-09 09:09:22,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:22,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093207864] [2021-11-09 09:09:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:22,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:27,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:27,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093207864] [2021-11-09 09:09:27,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093207864] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:27,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:27,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:09:27,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59874999] [2021-11-09 09:09:27,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:09:27,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:09:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:09:27,029 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2021-11-09 09:09:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:29,722 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2021-11-09 09:09:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:09:29,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) Word has length 18 [2021-11-09 09:09:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:29,732 INFO L225 Difference]: With dead ends: 111 [2021-11-09 09:09:29,732 INFO L226 Difference]: Without dead ends: 68 [2021-11-09 09:09:29,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:09:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-09 09:09:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-11-09 09:09:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 62 states have internal predecessors, (71), 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) [2021-11-09 09:09:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-09 09:09:29,746 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-09 09:09:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:29,747 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-09 09:09:29,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2021-11-09 09:09:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-09 09:09:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-09 09:09:29,750 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:29,750 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:29,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:09:29,751 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2021-11-09 09:09:29,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:29,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336785927] [2021-11-09 09:09:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:29,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:30,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:30,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336785927] [2021-11-09 09:09:30,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336785927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:30,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:30,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:09:30,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448624353] [2021-11-09 09:09:30,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:09:30,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:09:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:09:30,327 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-11-09 09:09:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:32,728 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2021-11-09 09:09:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:09:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2021-11-09 09:09:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:32,731 INFO L225 Difference]: With dead ends: 108 [2021-11-09 09:09:32,731 INFO L226 Difference]: Without dead ends: 61 [2021-11-09 09:09:32,731 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:09:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-09 09:09:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-09 09:09:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 60 states have internal predecessors, (66), 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) [2021-11-09 09:09:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2021-11-09 09:09:32,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 18 [2021-11-09 09:09:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:32,740 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2021-11-09 09:09:32,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-11-09 09:09:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-11-09 09:09:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:09:32,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:32,741 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:32,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:09:32,742 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 501656654, now seen corresponding path program 1 times [2021-11-09 09:09:32,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:32,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600234896] [2021-11-09 09:09:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:32,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:33,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:33,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600234896] [2021-11-09 09:09:33,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600234896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:33,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:33,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:09:33,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208247097] [2021-11-09 09:09:33,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:09:33,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:09:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:09:33,131 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-09 09:09:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:33,218 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-11-09 09:09:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:09:33,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-11-09 09:09:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:33,221 INFO L225 Difference]: With dead ends: 82 [2021-11-09 09:09:33,221 INFO L226 Difference]: Without dead ends: 61 [2021-11-09 09:09:33,221 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:09:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-09 09:09:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-09 09:09:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 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) [2021-11-09 09:09:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-11-09 09:09:33,229 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2021-11-09 09:09:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:33,230 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-11-09 09:09:33,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-11-09 09:09:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-11-09 09:09:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:09:33,232 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:33,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:33,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:09:33,233 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1522937572, now seen corresponding path program 1 times [2021-11-09 09:09:33,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:33,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805910663] [2021-11-09 09:09:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:33,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:33,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:33,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805910663] [2021-11-09 09:09:33,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805910663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:33,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:33,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:09:33,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310752132] [2021-11-09 09:09:33,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:09:33,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:09:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:09:33,890 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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) [2021-11-09 09:09:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:34,857 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-11-09 09:09:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 09:09:34,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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) Word has length 20 [2021-11-09 09:09:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:34,861 INFO L225 Difference]: With dead ends: 114 [2021-11-09 09:09:34,861 INFO L226 Difference]: Without dead ends: 110 [2021-11-09 09:09:34,862 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:09:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-09 09:09:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2021-11-09 09:09:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.15) internal successors, (69), 64 states have internal predecessors, (69), 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) [2021-11-09 09:09:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-11-09 09:09:34,879 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 20 [2021-11-09 09:09:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:34,880 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-09 09:09:34,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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) [2021-11-09 09:09:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-11-09 09:09:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:09:34,885 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:34,885 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:34,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:09:34,886 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1962683098, now seen corresponding path program 1 times [2021-11-09 09:09:34,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:34,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843568399] [2021-11-09 09:09:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:34,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:35,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:35,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843568399] [2021-11-09 09:09:35,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843568399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:35,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:35,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 09:09:35,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599909463] [2021-11-09 09:09:35,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 09:09:35,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 09:09:35,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:09:35,900 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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) [2021-11-09 09:09:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:40,011 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2021-11-09 09:09:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-09 09:09:40,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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) Word has length 20 [2021-11-09 09:09:40,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:40,013 INFO L225 Difference]: With dead ends: 114 [2021-11-09 09:09:40,013 INFO L226 Difference]: Without dead ends: 110 [2021-11-09 09:09:40,014 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2021-11-09 09:09:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-09 09:09:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 56. [2021-11-09 09:09:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 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) [2021-11-09 09:09:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-11-09 09:09:40,030 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 20 [2021-11-09 09:09:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:40,031 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-09 09:09:40,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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) [2021-11-09 09:09:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-11-09 09:09:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 09:09:40,033 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:40,034 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:40,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:09:40,034 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash -863865621, now seen corresponding path program 1 times [2021-11-09 09:09:40,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391999030] [2021-11-09 09:09:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:43,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:43,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391999030] [2021-11-09 09:09:43,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391999030] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:43,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:43,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:09:43,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78408413] [2021-11-09 09:09:43,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:09:43,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:09:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:09:43,798 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-09 09:09:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:48,465 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-11-09 09:09:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:09:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 24 [2021-11-09 09:09:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:48,466 INFO L225 Difference]: With dead ends: 56 [2021-11-09 09:09:48,467 INFO L226 Difference]: Without dead ends: 54 [2021-11-09 09:09:48,467 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:09:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-09 09:09:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-09 09:09:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 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) [2021-11-09 09:09:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-11-09 09:09:48,474 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 24 [2021-11-09 09:09:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:48,475 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-11-09 09:09:48,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2021-11-09 09:09:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-11-09 09:09:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 09:09:48,476 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:48,477 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:48,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:09:48,477 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1075136575, now seen corresponding path program 1 times [2021-11-09 09:09:48,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:48,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117029322] [2021-11-09 09:09:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:48,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:49,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:49,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117029322] [2021-11-09 09:09:49,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117029322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:49,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:49,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:09:49,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956703187] [2021-11-09 09:09:49,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:09:49,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:49,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:09:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:09:49,355 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2021-11-09 09:09:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:54,460 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2021-11-09 09:09:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:09:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) Word has length 26 [2021-11-09 09:09:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:54,462 INFO L225 Difference]: With dead ends: 113 [2021-11-09 09:09:54,462 INFO L226 Difference]: Without dead ends: 82 [2021-11-09 09:09:54,463 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-11-09 09:09:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-09 09:09:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2021-11-09 09:09:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.11864406779661) internal successors, (66), 61 states have internal predecessors, (66), 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) [2021-11-09 09:09:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-11-09 09:09:54,470 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 26 [2021-11-09 09:09:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:54,470 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-11-09 09:09:54,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2021-11-09 09:09:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-11-09 09:09:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 09:09:54,472 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:54,472 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:54,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 09:09:54,473 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 27288689, now seen corresponding path program 1 times [2021-11-09 09:09:54,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:54,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080618351] [2021-11-09 09:09:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:54,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:55,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:55,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080618351] [2021-11-09 09:09:55,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080618351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:55,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:55,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:09:55,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369832225] [2021-11-09 09:09:55,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:09:55,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:55,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:09:55,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:09:55,100 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2021-11-09 09:09:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:59,717 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-11-09 09:09:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:09:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) Word has length 27 [2021-11-09 09:09:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:09:59,722 INFO L225 Difference]: With dead ends: 62 [2021-11-09 09:09:59,722 INFO L226 Difference]: Without dead ends: 60 [2021-11-09 09:09:59,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:09:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-09 09:09:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-09 09:09:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.103448275862069) internal successors, (64), 59 states have internal predecessors, (64), 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) [2021-11-09 09:09:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-11-09 09:09:59,729 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 27 [2021-11-09 09:09:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:09:59,730 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-11-09 09:09:59,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2021-11-09 09:09:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-11-09 09:09:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 09:09:59,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:09:59,732 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:59,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:09:59,732 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:09:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1328145208, now seen corresponding path program 1 times [2021-11-09 09:09:59,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:59,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019998298] [2021-11-09 09:09:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:59,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:10:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:10:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:10:01,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:10:01,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019998298] [2021-11-09 09:10:01,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019998298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:10:01,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:10:01,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:10:01,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707057256] [2021-11-09 09:10:01,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:10:01,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:10:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:10:01,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:10:01,186 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) [2021-11-09 09:10:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:10:08,802 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-11-09 09:10:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:10:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) Word has length 32 [2021-11-09 09:10:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:10:08,804 INFO L225 Difference]: With dead ends: 76 [2021-11-09 09:10:08,804 INFO L226 Difference]: Without dead ends: 52 [2021-11-09 09:10:08,804 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:10:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-09 09:10:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-11-09 09:10:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 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) [2021-11-09 09:10:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-11-09 09:10:08,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2021-11-09 09:10:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:10:08,810 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-11-09 09:10:08,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) [2021-11-09 09:10:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-11-09 09:10:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 09:10:08,811 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:10:08,812 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:10:08,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:10:08,812 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:10:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:10:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash -416697772, now seen corresponding path program 1 times [2021-11-09 09:10:08,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:10:08,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38219499] [2021-11-09 09:10:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:10:08,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:10:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:10:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:10:09,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:10:09,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38219499] [2021-11-09 09:10:09,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38219499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:10:09,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:10:09,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:10:09,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770758800] [2021-11-09 09:10:09,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:10:09,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:10:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:10:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:10:09,276 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2021-11-09 09:10:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:10:11,657 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2021-11-09 09:10:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:10:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) Word has length 32 [2021-11-09 09:10:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:10:11,659 INFO L225 Difference]: With dead ends: 107 [2021-11-09 09:10:11,659 INFO L226 Difference]: Without dead ends: 68 [2021-11-09 09:10:11,659 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:10:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-09 09:10:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2021-11-09 09:10:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 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) [2021-11-09 09:10:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-11-09 09:10:11,664 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 32 [2021-11-09 09:10:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:10:11,665 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-11-09 09:10:11,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2021-11-09 09:10:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-11-09 09:10:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 09:10:11,666 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:10:11,666 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:10:11,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 09:10:11,666 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:10:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:10:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1234346222, now seen corresponding path program 1 times [2021-11-09 09:10:11,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:10:11,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208639983] [2021-11-09 09:10:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:10:11,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:10:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:10:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:10:15,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:10:15,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208639983] [2021-11-09 09:10:15,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208639983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:10:15,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:10:15,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:10:15,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205415622] [2021-11-09 09:10:15,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:10:15,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:10:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:10:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:10:15,384 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-11-09 09:10:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:10:20,369 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2021-11-09 09:10:20,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:10:20,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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) Word has length 32 [2021-11-09 09:10:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:10:20,370 INFO L225 Difference]: With dead ends: 66 [2021-11-09 09:10:20,370 INFO L226 Difference]: Without dead ends: 47 [2021-11-09 09:10:20,371 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-11-09 09:10:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-09 09:10:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-11-09 09:10:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 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) [2021-11-09 09:10:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2021-11-09 09:10:20,376 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 32 [2021-11-09 09:10:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:10:20,376 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2021-11-09 09:10:20,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-11-09 09:10:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2021-11-09 09:10:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 09:10:20,378 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:10:20,378 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:10:20,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 09:10:20,378 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:10:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:10:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash -911472183, now seen corresponding path program 1 times [2021-11-09 09:10:20,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:10:20,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864730138] [2021-11-09 09:10:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:10:20,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:10:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:10:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:10:21,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:10:21,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864730138] [2021-11-09 09:10:21,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864730138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:10:21,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:10:21,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:10:21,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606073233] [2021-11-09 09:10:21,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:10:21,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:10:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:10:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:10:21,834 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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) [2021-11-09 09:10:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:10:27,319 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2021-11-09 09:10:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:10:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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) Word has length 38 [2021-11-09 09:10:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:10:27,320 INFO L225 Difference]: With dead ends: 61 [2021-11-09 09:10:27,320 INFO L226 Difference]: Without dead ends: 45 [2021-11-09 09:10:27,321 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-11-09 09:10:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-09 09:10:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-09 09:10:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0) internal successors, (44), 44 states have internal predecessors, (44), 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) [2021-11-09 09:10:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2021-11-09 09:10:27,327 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 38 [2021-11-09 09:10:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:10:27,327 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2021-11-09 09:10:27,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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) [2021-11-09 09:10:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2021-11-09 09:10:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-09 09:10:27,329 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:10:27,329 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:10:27,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 09:10:27,329 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 09:10:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:10:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash 52794010, now seen corresponding path program 1 times [2021-11-09 09:10:27,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:10:27,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345076016] [2021-11-09 09:10:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:10:27,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:10:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:10:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:10:33,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:10:33,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345076016] [2021-11-09 09:10:33,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345076016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:10:33,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:10:33,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:10:33,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926600141] [2021-11-09 09:10:33,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:10:33,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:10:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:10:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:10:33,698 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) [2021-11-09 09:10:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:10:38,534 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2021-11-09 09:10:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:10:38,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) Word has length 44 [2021-11-09 09:10:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:10:38,536 INFO L225 Difference]: With dead ends: 45 [2021-11-09 09:10:38,536 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 09:10:38,537 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:10:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 09:10:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 09:10:38,537 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) [2021-11-09 09:10:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 09:10:38,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-11-09 09:10:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:10:38,538 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 09:10:38,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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) [2021-11-09 09:10:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 09:10:38,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 09:10:38,542 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:10:38,542 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:10:38,543 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:10:38,543 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:10:38,544 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:10:38,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 09:10:38,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-09 09:10:38,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:10:38,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:10:38,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:10:38,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:10:38,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:10:38,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:10:41,064 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,065 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,065 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-09 09:10:41,065 INFO L857 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,065 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-09 09:10:41,065 INFO L857 garLoopResultBuilder]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,066 INFO L853 garLoopResultBuilder]: At program point L7386-3(lines 7384 7388) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse5 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset|) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse6 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse8 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0))) (.cse9 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| 8))) (and .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse2 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse3)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) .cse4 (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse3)) .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) .cse10)) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0)) .cse7 .cse8 .cse9 .cse10 (let ((.cse11 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse11 (* 18446744073709551616 (div .cse11 18446744073709551616))))))) [2021-11-09 09:10:41,066 INFO L857 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,067 INFO L853 garLoopResultBuilder]: At program point L7386-7(lines 7384 7388) the Hoare annotation is: (let ((.cse11 (+ 8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|))) (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse11))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse2 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse5 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse8 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse9 (not (= .cse12 0))) (.cse10 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2))) (or (and .cse0 .cse1 (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 18446744073709551616))) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)) .cse8 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0)) .cse9 .cse10) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse11) 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse2 .cse3 .cse4 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) .cse5 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) (= .cse12 ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)))))) [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,068 INFO L857 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,069 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,069 INFO L857 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,069 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-09 09:10:41,069 INFO L857 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,069 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-09 09:10:41,069 INFO L857 garLoopResultBuilder]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,070 INFO L857 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,070 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-09 09:10:41,070 INFO L857 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,070 INFO L857 garLoopResultBuilder]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,070 INFO L857 garLoopResultBuilder]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,071 INFO L857 garLoopResultBuilder]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,071 INFO L857 garLoopResultBuilder]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,071 INFO L857 garLoopResultBuilder]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,071 INFO L857 garLoopResultBuilder]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,071 INFO L857 garLoopResultBuilder]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2021-11-09 09:10:41,072 INFO L857 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-09 09:10:41,072 INFO L860 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-11-09 09:10:41,072 INFO L853 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) [2021-11-09 09:10:41,072 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-09 09:10:41,072 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:10:41,072 INFO L853 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse2 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse11 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse5 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse8 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0))) (.cse9 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0))) (.cse10 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse5 .cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| 18446744073709551616))) .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 18446744073709551616 (div .cse11 18446744073709551616)))) (and .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse2 .cse3 (<= .cse11 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse11) 18446744073709551616)))) .cse4 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) .cse5 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0)))) [2021-11-09 09:10:41,072 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:10:41,072 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:10:41,073 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 7101 7111) no Hoare annotation was computed. [2021-11-09 09:10:41,073 INFO L857 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-11-09 09:10:41,073 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:10:41,073 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,073 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-09 09:10:41,074 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,074 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,074 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,075 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,076 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:10:41,076 INFO L857 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-11-09 09:10:41,076 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse0 (+ 8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|))) (and (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0) 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| 0) (= ULTIMATE.start_assert_bytes_match_~a.offset 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ 8 ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) 0)) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base))) [2021-11-09 09:10:41,076 INFO L857 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-11-09 09:10:41,079 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:10:41,081 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:10:41,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:41,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,110 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:41,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,122 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,124 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,124 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,127 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,128 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,128 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:41,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:41,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,137 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:41,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:41,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,143 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:41,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:41,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:10:41 BoogieIcfgContainer [2021-11-09 09:10:41,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:10:41,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:10:41,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:10:41,147 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:10:41,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:09:19" (3/4) ... [2021-11-09 09:10:41,150 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 09:10:41,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2021-11-09 09:10:41,181 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-11-09 09:10:41,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-09 09:10:41,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-09 09:10:41,187 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-09 09:10:41,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-09 09:10:41,190 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-09 09:10:41,192 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 09:10:41,242 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && size == length [2021-11-09 09:10:41,242 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\result <= 1 && !(cur == 0)) && \result == 0) && cursor == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == bytes) && array == #memory_$Pointer$[cur][cur + 8]) && cur == 0) && bytes == 0) && 1 <= \result) && 0 == #memory_$Pointer$[cur][cur + 8]) && unknown-#memory_int-unknown[cur][cur] == length) && length == len) && cur == cursor) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && array == 0) && cur == cursor) || ((((((((((((\result <= 1 && !(cur == 0)) && !(\result == 0)) && !(bytes == 0)) && 1 <= \result) && unknown-#memory_int-unknown[cur][cur] == length) && length == len) && !(array == 0)) && cur == cursor) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && cur == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) [2021-11-09 09:10:41,243 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result <= 1 && !(cur == 0)) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && !(bytes == 0)) && 1 <= cond) && 1 <= \result) && !(aws_byte_cursor_from_array_#res.ptr == 0)) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && length == len) && !(array == 0)) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) || (((((((((((((((((((((\result <= 1 && !(cur == 0)) && \result == 0) && cursor == 0) && cond / 256 <= 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[cursor][cursor]) / 18446744073709551616)) && unknown-#res!len-unknown == length) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 1 <= cond) && array == bytes) && length <= 18446744073709551615 + 18446744073709551616 * ((-1 + length) / 18446744073709551616)) && cur == 0) && bytes == 0) && 1 <= \result) && aws_byte_cursor_from_array_#res.ptr == 0) && aws_byte_cursor_from_array_#res.ptr == array) && length == len) && !(array == 0)) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && array == 0) [2021-11-09 09:10:41,243 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result <= 1 && !(cur == 0)) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && !(bytes == 0)) && 1 <= cond) && 1 <= \result) && unknown-#memory_int-unknown[cur][cur] == length) && !(aws_byte_cursor_from_array_#res.ptr == 0)) && length == len) && !(array == 0)) && !(#memory_$Pointer$[cur][8 + cur] == 0)) && size == length) || ((((((((((((((((((((((\result <= 1 && !(cur == 0)) && #memory_$Pointer$[cur][8 + cur] == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 1 <= cond) && array == bytes) && #memory_$Pointer$[cur][8 + cur] == array) && cur == 0) && bytes == 0) && 1 <= \result) && aws_byte_cursor_from_array_#res.ptr == 0) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cur][cur] == length) && length == len) && !(#memory_$Pointer$[cur][8 + cur] == 0)) && size == length) && array == 0) && cur == cursor) && cur == cursor) [2021-11-09 09:10:41,243 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(cur == 0) && #memory_$Pointer$[cur][8 + cur] == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 1 <= cond) && array == bytes) && #memory_$Pointer$[cur][8 + cur] == array) && length <= 18446744073709551615 + 18446744073709551616 * ((-1 + length) / 18446744073709551616)) && cur == 0) && bytes == 0) && aws_byte_cursor_from_array_#res.ptr == 0) && a == 0) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cur][cur] == length) && a == b) && length == len) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && array == 0) && b == 0) && cur == cursor) && cur == cursor [2021-11-09 09:10:42,389 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:10:42,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:10:42,391 INFO L168 Benchmark]: Toolchain (without parser) took 97945.27 ms. Allocated memory was 100.7 MB in the beginning and 513.8 MB in the end (delta: 413.1 MB). Free memory was 57.6 MB in the beginning and 181.7 MB in the end (delta: -124.1 MB). Peak memory consumption was 346.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,392 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 75.5 MB. Free memory was 49.1 MB in the beginning and 49.0 MB in the end (delta: 29.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:10:42,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3196.89 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 57.4 MB in the beginning and 42.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 307.71 ms. Allocated memory is still 121.6 MB. Free memory was 42.5 MB in the beginning and 62.6 MB in the end (delta: -20.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,394 INFO L168 Benchmark]: Boogie Preprocessor took 150.36 ms. Allocated memory is still 121.6 MB. Free memory was 62.6 MB in the beginning and 55.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,394 INFO L168 Benchmark]: RCFGBuilder took 11379.98 ms. Allocated memory was 121.6 MB in the beginning and 276.8 MB in the end (delta: 155.2 MB). Free memory was 55.0 MB in the beginning and 120.5 MB in the end (delta: -65.4 MB). Peak memory consumption was 158.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,395 INFO L168 Benchmark]: TraceAbstraction took 81660.38 ms. Allocated memory was 276.8 MB in the beginning and 513.8 MB in the end (delta: 237.0 MB). Free memory was 119.4 MB in the beginning and 394.9 MB in the end (delta: -275.5 MB). Peak memory consumption was 208.7 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,395 INFO L168 Benchmark]: Witness Printer took 1243.19 ms. Allocated memory is still 513.8 MB. Free memory was 394.9 MB in the beginning and 181.7 MB in the end (delta: 213.2 MB). Peak memory consumption was 268.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:10:42,398 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 75.5 MB. Free memory was 49.1 MB in the beginning and 49.0 MB in the end (delta: 29.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3196.89 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 57.4 MB in the beginning and 42.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 307.71 ms. Allocated memory is still 121.6 MB. Free memory was 42.5 MB in the beginning and 62.6 MB in the end (delta: -20.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 150.36 ms. Allocated memory is still 121.6 MB. Free memory was 62.6 MB in the beginning and 55.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 11379.98 ms. Allocated memory was 121.6 MB in the beginning and 276.8 MB in the end (delta: 155.2 MB). Free memory was 55.0 MB in the beginning and 120.5 MB in the end (delta: -65.4 MB). Peak memory consumption was 158.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 81660.38 ms. Allocated memory was 276.8 MB in the beginning and 513.8 MB in the end (delta: 237.0 MB). Free memory was 119.4 MB in the beginning and 394.9 MB in the end (delta: -275.5 MB). Peak memory consumption was 208.7 MB. Max. memory is 16.1 GB. * Witness Printer took 1243.19 ms. Allocated memory is still 513.8 MB. Free memory was 394.9 MB in the beginning and 181.7 MB in the end (delta: 213.2 MB). Peak memory consumption was 268.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 81.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 726 SDtfs, 1644 SDslu, 1792 SDs, 0 SdLazy, 1227 SolverSat, 169 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 42.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 174 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 656 HoareAnnotationTreeSize, 6 FomulaSimplifications, 3782 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 296 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 19.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 2741 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 5 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2021-11-09 09:10:42,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:42,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:42,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,417 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((!(cur == 0) && #memory_$Pointer$[cur][8 + cur] == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 1 <= cond) && array == bytes) && #memory_$Pointer$[cur][8 + cur] == array) && length <= 18446744073709551615 + 18446744073709551616 * ((-1 + length) / 18446744073709551616)) && cur == 0) && bytes == 0) && aws_byte_cursor_from_array_#res.ptr == 0) && a == 0) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cur][cur] == length) && a == b) && length == len) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && array == 0) && b == 0) && cur == cursor) && cur == cursor - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2021-11-09 09:10:42,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,419 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((\result <= 1 && !(cur == 0)) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && !(bytes == 0)) && 1 <= cond) && 1 <= \result) && !(aws_byte_cursor_from_array_#res.ptr == 0)) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && length == len) && !(array == 0)) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) || (((((((((((((((((((((\result <= 1 && !(cur == 0)) && \result == 0) && cursor == 0) && cond / 256 <= 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[cursor][cursor]) / 18446744073709551616)) && unknown-#res!len-unknown == length) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 1 <= cond) && array == bytes) && length <= 18446744073709551615 + 18446744073709551616 * ((-1 + length) / 18446744073709551616)) && cur == 0) && bytes == 0) && 1 <= \result) && aws_byte_cursor_from_array_#res.ptr == 0) && aws_byte_cursor_from_array_#res.ptr == array) && length == len) && !(array == 0)) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && array == 0) - InvariantResult [Line: 7384]: Loop Invariant [2021-11-09 09:10:42,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:42,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,426 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:42,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,427 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\result <= 1 && !(cur == 0)) && \result == 0) && cursor == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == bytes) && array == #memory_$Pointer$[cur][cur + 8]) && cur == 0) && bytes == 0) && 1 <= \result) && 0 == #memory_$Pointer$[cur][cur + 8]) && unknown-#memory_int-unknown[cur][cur] == length) && length == len) && cur == cursor) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && array == 0) && cur == cursor) || ((((((((((((\result <= 1 && !(cur == 0)) && !(\result == 0)) && !(bytes == 0)) && 1 <= \result) && unknown-#memory_int-unknown[cur][cur] == length) && length == len) && !(array == 0)) && cur == cursor) && !(#memory_$Pointer$[cursor][8 + cursor] == 0)) && size == length) && cur == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) - InvariantResult [Line: 7384]: Loop Invariant [2021-11-09 09:10:42,429 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:42,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,430 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,430 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,432 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:10:42,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:10:42,433 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,433 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2021-11-09 09:10:42,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((\result <= 1 && !(cur == 0)) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && !(bytes == 0)) && 1 <= cond) && 1 <= \result) && unknown-#memory_int-unknown[cur][cur] == length) && !(aws_byte_cursor_from_array_#res.ptr == 0)) && length == len) && !(array == 0)) && !(#memory_$Pointer$[cur][8 + cur] == 0)) && size == length) || ((((((((((((((((((((((\result <= 1 && !(cur == 0)) && #memory_$Pointer$[cur][8 + cur] == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && unknown-#res!len-unknown == length) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && 1 <= cond) && array == bytes) && #memory_$Pointer$[cur][8 + cur] == array) && cur == 0) && bytes == 0) && 1 <= \result) && aws_byte_cursor_from_array_#res.ptr == 0) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cur][cur] == length) && length == len) && !(#memory_$Pointer$[cur][8 + cur] == 0)) && size == length) && array == 0) && cur == cursor) && cur == cursor) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && size == length RESULT: Ultimate proved your program to be correct! [2021-11-09 09:10:42,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3633f12a-b7a1-4d12-adb3-e6601bc418e8/bin/uautomizer-IVEQpCNsaX/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