./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_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_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/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_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/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_b702fa71-5283-4638-a67f-0df36f6442a5/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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:33:30,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:33:30,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:33:30,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:33:30,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:33:30,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:33:30,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:33:30,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:33:30,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:33:30,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:33:30,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:33:30,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:33:30,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:33:30,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:33:30,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:33:30,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:33:30,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:33:30,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:33:30,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:33:30,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:33:30,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:33:30,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:33:30,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:33:30,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:33:30,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:33:30,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:33:30,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:33:30,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:33:30,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:33:30,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:33:30,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:33:30,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:33:30,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:33:30,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:33:30,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:33:30,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:33:30,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:33:30,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:33:30,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:33:30,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:33:30,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:33:30,655 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-09 09:33:30,717 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:33:30,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:33:30,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:33:30,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:33:30,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:33:30,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:33:30,720 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:33:30,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:33:30,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:33:30,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:33:30,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:33:30,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:33:30,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:33:30,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:33:30,722 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:33:30,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:33:30,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:33:30,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:33:30,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:33:30,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:33:30,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:33:30,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:33:30,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:33:30,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:33:30,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:33:30,724 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:33:30,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:33:30,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:33:30,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:33:30,725 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_b702fa71-5283-4638-a67f-0df36f6442a5/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_b702fa71-5283-4638-a67f-0df36f6442a5/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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2021-11-09 09:33:31,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:33:31,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:33:31,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:33:31,143 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:33:31,145 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:33:31,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-11-09 09:33:31,260 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/data/4ed470caf/a443da47196a416c9ca226216c480d29/FLAG67317b788 [2021-11-09 09:33:32,146 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:33:32,147 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-11-09 09:33:32,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/data/4ed470caf/a443da47196a416c9ca226216c480d29/FLAG67317b788 [2021-11-09 09:33:32,618 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/data/4ed470caf/a443da47196a416c9ca226216c480d29 [2021-11-09 09:33:32,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:33:32,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:33:32,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:33:32,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:33:32,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:33:32,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:33:32" (1/1) ... [2021-11-09 09:33:32,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baef03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:32, skipping insertion in model container [2021-11-09 09:33:32,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:33:32" (1/1) ... [2021-11-09 09:33:32,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:33:32,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:33:33,099 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_b702fa71-5283-4638-a67f-0df36f6442a5/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-09 09:33:33,108 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_b702fa71-5283-4638-a67f-0df36f6442a5/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-09 09:33:33,138 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-09 09:33:33,146 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-09 09:33:34,464 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,469 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,470 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,472 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,475 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,508 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,509 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,511 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:34,512 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,034 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-09 09:33:35,035 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-09 09:33:35,037 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-09 09:33:35,039 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-09 09:33:35,041 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-09 09:33:35,042 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-09 09:33:35,044 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-09 09:33:35,045 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-09 09:33:35,046 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-09 09:33:35,047 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-09 09:33:35,310 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-09 09:33:35,561 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:33:35,722 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:33:35,753 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_b702fa71-5283-4638-a67f-0df36f6442a5/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-09 09:33:35,761 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_b702fa71-5283-4638-a67f-0df36f6442a5/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-09 09:33:35,763 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-09 09:33:35,765 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-09 09:33:35,821 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,822 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,822 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,823 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,827 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,838 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,838 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,840 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,840 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:35,894 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-09 09:33:35,895 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-09 09:33:35,896 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-09 09:33:35,897 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-09 09:33:35,899 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-09 09:33:35,899 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-09 09:33:35,900 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-09 09:33:35,904 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-09 09:33:35,904 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-09 09:33:35,905 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-09 09:33:35,945 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-09 09:33:36,107 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:36,107 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 09:33:36,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:33:36,517 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:33:36,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36 WrapperNode [2021-11-09 09:33:36,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:33:36,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:33:36,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:33:36,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:33:36,529 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:33:36" (1/1) ... [2021-11-09 09:33:36,698 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:33:36" (1/1) ... [2021-11-09 09:33:36,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:33:36,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:33:36,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:33:36,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:33:36,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:36,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:33:36,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:33:36,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:33:36,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:33:36,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (1/1) ... [2021-11-09 09:33:37,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:33:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:33:37,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:33:37,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:33:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 09:33:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 09:33:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 09:33:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 09:33:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:33:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:33:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:33:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 09:33:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-09 09:33:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:33:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:33:48,786 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:33:48,787 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2021-11-09 09:33:48,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:33:48 BoogieIcfgContainer [2021-11-09 09:33:48,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:33:48,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:33:48,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:33:48,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:33:48,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:33:32" (1/3) ... [2021-11-09 09:33:48,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee4d1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:33:48, skipping insertion in model container [2021-11-09 09:33:48,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:36" (2/3) ... [2021-11-09 09:33:48,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee4d1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:33:48, skipping insertion in model container [2021-11-09 09:33:48,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:33:48" (3/3) ... [2021-11-09 09:33:48,801 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-11-09 09:33:48,808 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:33:48,808 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-09 09:33:48,871 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:33:48,878 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:33:48,879 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-09 09:33:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 states have internal predecessors, (104), 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:33:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-09 09:33:48,906 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:48,907 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:33:48,908 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-09 09:33:48,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:48,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934548185] [2021-11-09 09:33:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:48,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:49,834 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:33:49,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:49,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934548185] [2021-11-09 09:33:49,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934548185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:49,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:49,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:33:49,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882916013] [2021-11-09 09:33:49,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-09 09:33:49,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-09 09:33:49,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 09:33:49,875 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 states have internal predecessors, (104), 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 7.0) internal successors, (14), 2 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:33:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:33:49,912 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2021-11-09 09:33:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-09 09:33:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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:33:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:33:49,925 INFO L225 Difference]: With dead ends: 153 [2021-11-09 09:33:49,925 INFO L226 Difference]: Without dead ends: 71 [2021-11-09 09:33:49,929 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:33:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-09 09:33:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-09 09:33:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.328125) internal successors, (85), 70 states have internal predecessors, (85), 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:33:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2021-11-09 09:33:49,977 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 14 [2021-11-09 09:33:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:33:49,978 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2021-11-09 09:33:49,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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:33:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2021-11-09 09:33:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-09 09:33:49,980 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:49,982 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:33:49,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:33:49,983 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-09 09:33:49,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:49,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962376371] [2021-11-09 09:33:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:49,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:50,454 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:33:50,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:50,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962376371] [2021-11-09 09:33:50,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962376371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:50,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:50,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:33:50,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019028062] [2021-11-09 09:33:50,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:33:50,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:33:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:33:50,458 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:33:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:33:50,578 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2021-11-09 09:33:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:33:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:33:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:33:50,583 INFO L225 Difference]: With dead ends: 120 [2021-11-09 09:33:50,583 INFO L226 Difference]: Without dead ends: 71 [2021-11-09 09:33:50,584 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:33:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-09 09:33:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-09 09:33:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 70 states have internal predecessors, (84), 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:33:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2021-11-09 09:33:50,606 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2021-11-09 09:33:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:33:50,607 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2021-11-09 09:33:50,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:33:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2021-11-09 09:33:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:33:50,608 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:50,608 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:33:50,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:33:50,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-09 09:33:50,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:50,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046462218] [2021-11-09 09:33:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:50,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:50,961 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:33:50,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:50,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046462218] [2021-11-09 09:33:50,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046462218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:50,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:50,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:33:50,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780063423] [2021-11-09 09:33:50,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:33:50,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:50,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:33:50,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:33:50,965 INFO L87 Difference]: Start difference. First operand 71 states and 84 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:33:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:33:51,185 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-11-09 09:33:51,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:33:51,190 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:33:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:33:51,192 INFO L225 Difference]: With dead ends: 173 [2021-11-09 09:33:51,192 INFO L226 Difference]: Without dead ends: 115 [2021-11-09 09:33:51,193 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:33:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-09 09:33:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2021-11-09 09:33:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 states have internal predecessors, (88), 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:33:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2021-11-09 09:33:51,207 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 20 [2021-11-09 09:33:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:33:51,208 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2021-11-09 09:33:51,208 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:33:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2021-11-09 09:33:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:33:51,212 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:51,212 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:33:51,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:33:51,214 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-09 09:33:51,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:51,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731305308] [2021-11-09 09:33:51,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:51,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:51,638 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:33:51,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:51,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731305308] [2021-11-09 09:33:51,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731305308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:51,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:51,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:33:51,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819530787] [2021-11-09 09:33:51,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:33:51,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:33:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:33:51,641 INFO L87 Difference]: Start difference. First operand 75 states and 88 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:33:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:33:51,838 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2021-11-09 09:33:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:33:51,839 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:33:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:33:51,840 INFO L225 Difference]: With dead ends: 147 [2021-11-09 09:33:51,840 INFO L226 Difference]: Without dead ends: 95 [2021-11-09 09:33:51,841 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:33:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-09 09:33:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2021-11-09 09:33:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 78 states have internal predecessors, (92), 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:33:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-11-09 09:33:51,859 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2021-11-09 09:33:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:33:51,860 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-11-09 09:33:51,860 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:33:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-11-09 09:33:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:33:51,862 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:51,863 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:33:51,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:33:51,863 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-09 09:33:51,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:51,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635243284] [2021-11-09 09:33:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:51,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:52,726 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:33:52,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:52,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635243284] [2021-11-09 09:33:52,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635243284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:52,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:52,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:33:52,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323509529] [2021-11-09 09:33:52,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:33:52,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:33:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:33:52,730 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:33:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:33:53,244 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2021-11-09 09:33:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:33:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:33:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:33:53,247 INFO L225 Difference]: With dead ends: 139 [2021-11-09 09:33:53,247 INFO L226 Difference]: Without dead ends: 135 [2021-11-09 09:33:53,247 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:33:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-09 09:33:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2021-11-09 09:33:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 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:33:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2021-11-09 09:33:53,256 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2021-11-09 09:33:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:33:53,257 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2021-11-09 09:33:53,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:33:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2021-11-09 09:33:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 09:33:53,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:53,259 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:33:53,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:33:53,260 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-09 09:33:53,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:53,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288184291] [2021-11-09 09:33:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:53,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:54,059 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:33:54,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:54,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288184291] [2021-11-09 09:33:54,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288184291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:54,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:54,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:33:54,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164426885] [2021-11-09 09:33:54,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:33:54,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:54,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:33:54,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:33:54,062 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:33:56,561 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2021-11-09 09:33:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:33:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:33:56,563 INFO L225 Difference]: With dead ends: 153 [2021-11-09 09:33:56,563 INFO L226 Difference]: Without dead ends: 94 [2021-11-09 09:33:56,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:33:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-09 09:33:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2021-11-09 09:33:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 states have internal predecessors, (102), 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:33:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-11-09 09:33:56,570 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 24 [2021-11-09 09:33:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:33:56,571 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-11-09 09:33:56,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:33:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-11-09 09:33:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 09:33:56,573 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:33:56,573 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:33:56,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:33:56,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:33:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:33:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-09 09:33:56,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:33:56,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686121888] [2021-11-09 09:33:56,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:33:56,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:33:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:33:57,221 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:33:57,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:33:57,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686121888] [2021-11-09 09:33:57,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686121888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:33:57,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:33:57,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:33:57,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126750115] [2021-11-09 09:33:57,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:33:57,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:33:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:33:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:33:57,224 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:34:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:01,942 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2021-11-09 09:34:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:34:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:34:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:01,944 INFO L225 Difference]: With dead ends: 206 [2021-11-09 09:34:01,945 INFO L226 Difference]: Without dead ends: 143 [2021-11-09 09:34:01,945 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:34:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-09 09:34:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2021-11-09 09:34:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 94 states have internal predecessors, (108), 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:34:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-11-09 09:34:01,951 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 24 [2021-11-09 09:34:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:01,951 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-11-09 09:34:01,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:34:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-11-09 09:34:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 09:34:01,953 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:01,953 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:34:01,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:34:01,953 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-09 09:34:01,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:01,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188700021] [2021-11-09 09:34:01,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:01,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:08,188 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:34:08,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:08,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188700021] [2021-11-09 09:34:08,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188700021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:08,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:08,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 09:34:08,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081508691] [2021-11-09 09:34:08,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 09:34:08,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 09:34:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:34:08,191 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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:34:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:11,419 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2021-11-09 09:34:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:34:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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:34:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:11,420 INFO L225 Difference]: With dead ends: 209 [2021-11-09 09:34:11,421 INFO L226 Difference]: Without dead ends: 130 [2021-11-09 09:34:11,421 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:34:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-09 09:34:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2021-11-09 09:34:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 97 states have internal predecessors, (111), 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:34:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-11-09 09:34:11,428 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 24 [2021-11-09 09:34:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:11,428 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-11-09 09:34:11,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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:34:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-11-09 09:34:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 09:34:11,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:11,429 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:34:11,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:34:11,430 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-09 09:34:11,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:11,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824313246] [2021-11-09 09:34:11,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:11,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:14,646 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:34:14,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:14,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824313246] [2021-11-09 09:34:14,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824313246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:14,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:14,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:34:14,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152414033] [2021-11-09 09:34:14,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:34:14,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:34:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:34:14,649 INFO L87 Difference]: Start difference. First operand 98 states and 111 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:34:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:17,349 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2021-11-09 09:34:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:34:17,350 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:34:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:17,351 INFO L225 Difference]: With dead ends: 185 [2021-11-09 09:34:17,352 INFO L226 Difference]: Without dead ends: 116 [2021-11-09 09:34:17,352 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:34:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-09 09:34:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-11-09 09:34:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 97 states have internal predecessors, (110), 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:34:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-11-09 09:34:17,357 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 24 [2021-11-09 09:34:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:17,358 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-11-09 09:34:17,358 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:34:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-11-09 09:34:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 09:34:17,359 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:17,359 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:34:17,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:34:17,360 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-09 09:34:17,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:17,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67620502] [2021-11-09 09:34:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:17,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:17,735 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:34:17,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:17,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67620502] [2021-11-09 09:34:17,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67620502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:17,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:17,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:34:17,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282055561] [2021-11-09 09:34:17,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:34:17,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:34:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:34:17,738 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:34:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:20,152 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2021-11-09 09:34:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:34:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:34:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:20,154 INFO L225 Difference]: With dead ends: 164 [2021-11-09 09:34:20,154 INFO L226 Difference]: Without dead ends: 93 [2021-11-09 09:34:20,154 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:34:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-09 09:34:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-09 09:34:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 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:34:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-11-09 09:34:20,160 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2021-11-09 09:34:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:20,160 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-11-09 09:34:20,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:34:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-11-09 09:34:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 09:34:20,162 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:20,162 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:34:20,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 09:34:20,162 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-09 09:34:20,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:20,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288429206] [2021-11-09 09:34:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:20,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:20,684 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:34:20,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:20,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288429206] [2021-11-09 09:34:20,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288429206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:20,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:20,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:34:20,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244107140] [2021-11-09 09:34:20,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:34:20,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:20,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:34:20,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:34:20,686 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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:34:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:21,581 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2021-11-09 09:34:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 09:34:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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:34:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:21,585 INFO L225 Difference]: With dead ends: 165 [2021-11-09 09:34:21,586 INFO L226 Difference]: Without dead ends: 161 [2021-11-09 09:34:21,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:34:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-09 09:34:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2021-11-09 09:34:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 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:34:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-09 09:34:21,592 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 26 [2021-11-09 09:34:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:21,592 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-09 09:34:21,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 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:34:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-09 09:34:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 09:34:21,594 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:21,594 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:34:21,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:34:21,594 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-09 09:34:21,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:21,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484579537] [2021-11-09 09:34:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:21,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:22,022 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:34:22,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:22,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484579537] [2021-11-09 09:34:22,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484579537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:22,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:22,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:34:22,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382676347] [2021-11-09 09:34:22,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:34:22,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:22,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:34:22,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:34:22,024 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:34:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:24,382 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-11-09 09:34:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:34:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:34:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:24,383 INFO L225 Difference]: With dead ends: 158 [2021-11-09 09:34:24,383 INFO L226 Difference]: Without dead ends: 93 [2021-11-09 09:34:24,384 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:34:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-09 09:34:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-11-09 09:34:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 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:34:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-11-09 09:34:24,388 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2021-11-09 09:34:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:24,389 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-11-09 09:34:24,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:34:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-11-09 09:34:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 09:34:24,390 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:24,390 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:34:24,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:34:24,391 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-09 09:34:24,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:24,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592062610] [2021-11-09 09:34:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:24,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:24,643 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:34:24,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:24,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592062610] [2021-11-09 09:34:24,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592062610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:24,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:24,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:34:24,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229090862] [2021-11-09 09:34:24,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:34:24,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:34:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:34:24,646 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:34:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:24,741 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2021-11-09 09:34:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:34:24,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:34:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:24,743 INFO L225 Difference]: With dead ends: 118 [2021-11-09 09:34:24,743 INFO L226 Difference]: Without dead ends: 89 [2021-11-09 09:34:24,743 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:34:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-09 09:34:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-09 09:34:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 88 states have internal predecessors, (96), 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:34:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-11-09 09:34:24,748 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 26 [2021-11-09 09:34:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:24,749 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-11-09 09:34:24,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:34:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-11-09 09:34:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 09:34:24,750 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:24,750 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] [2021-11-09 09:34:24,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 09:34:24,751 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-09 09:34:24,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:24,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900088573] [2021-11-09 09:34:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:24,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:25,272 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:34:25,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:25,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900088573] [2021-11-09 09:34:25,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900088573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:25,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:25,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:34:25,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235175238] [2021-11-09 09:34:25,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:34:25,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:25,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:34:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:34:25,274 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:34:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:31,972 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-11-09 09:34:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:34:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2021-11-09 09:34:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:31,973 INFO L225 Difference]: With dead ends: 89 [2021-11-09 09:34:31,973 INFO L226 Difference]: Without dead ends: 87 [2021-11-09 09:34:31,973 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:34:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-09 09:34:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-09 09:34:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.146341463414634) internal successors, (94), 86 states have internal predecessors, (94), 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:34:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-11-09 09:34:31,978 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 34 [2021-11-09 09:34:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:31,978 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-11-09 09:34:31,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:34:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-11-09 09:34:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 09:34:31,979 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:31,980 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] [2021-11-09 09:34:31,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 09:34:31,980 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-09 09:34:31,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:31,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22294155] [2021-11-09 09:34:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:31,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:34,452 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:34:34,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:34,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22294155] [2021-11-09 09:34:34,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22294155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:34,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:34,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:34:34,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238049431] [2021-11-09 09:34:34,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:34:34,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:34:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:34:34,454 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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:34:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:39,145 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-11-09 09:34:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:34:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 36 [2021-11-09 09:34:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:39,146 INFO L225 Difference]: With dead ends: 87 [2021-11-09 09:34:39,146 INFO L226 Difference]: Without dead ends: 85 [2021-11-09 09:34:39,147 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:34:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-09 09:34:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-11-09 09:34:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 84 states have internal predecessors, (92), 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:34:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-11-09 09:34:39,151 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 36 [2021-11-09 09:34:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:39,151 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-11-09 09:34:39,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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:34:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-11-09 09:34:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 09:34:39,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:39,152 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] [2021-11-09 09:34:39,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 09:34:39,153 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2021-11-09 09:34:39,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:39,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757365631] [2021-11-09 09:34:39,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:39,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:39,706 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:34:39,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:39,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757365631] [2021-11-09 09:34:39,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757365631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:39,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:39,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:34:39,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999275220] [2021-11-09 09:34:39,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:34:39,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:34:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:34:39,708 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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:34:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:42,372 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-11-09 09:34:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:34:42,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2021-11-09 09:34:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:42,374 INFO L225 Difference]: With dead ends: 125 [2021-11-09 09:34:42,374 INFO L226 Difference]: Without dead ends: 98 [2021-11-09 09:34:42,374 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:34:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-09 09:34:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2021-11-09 09:34:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 86 states have internal predecessors, (94), 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:34:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-11-09 09:34:42,379 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 36 [2021-11-09 09:34:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:42,379 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-11-09 09:34:42,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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:34:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-11-09 09:34:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 09:34:42,380 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:42,380 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] [2021-11-09 09:34:42,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 09:34:42,381 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-09 09:34:42,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:42,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256848942] [2021-11-09 09:34:42,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:42,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:45,075 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:34:45,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:45,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256848942] [2021-11-09 09:34:45,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256848942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:45,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:45,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:34:45,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538748807] [2021-11-09 09:34:45,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:34:45,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:34:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:34:45,077 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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:34:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:48,069 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2021-11-09 09:34:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:34:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 36 [2021-11-09 09:34:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:48,071 INFO L225 Difference]: With dead ends: 198 [2021-11-09 09:34:48,071 INFO L226 Difference]: Without dead ends: 158 [2021-11-09 09:34:48,072 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:34:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-09 09:34:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2021-11-09 09:34:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 108 states have internal predecessors, (118), 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:34:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2021-11-09 09:34:48,078 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 36 [2021-11-09 09:34:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:48,079 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2021-11-09 09:34:48,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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:34:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2021-11-09 09:34:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 09:34:48,080 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:48,080 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] [2021-11-09 09:34:48,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 09:34:48,080 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-09 09:34:48,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:48,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180051077] [2021-11-09 09:34:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:48,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:48,557 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:34:48,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:48,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180051077] [2021-11-09 09:34:48,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180051077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:48,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:48,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:34:48,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618290938] [2021-11-09 09:34:48,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:34:48,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:34:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:34:48,559 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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:34:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:51,340 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2021-11-09 09:34:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:34:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2021-11-09 09:34:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:51,342 INFO L225 Difference]: With dead ends: 162 [2021-11-09 09:34:51,342 INFO L226 Difference]: Without dead ends: 120 [2021-11-09 09:34:51,343 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:34:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-09 09:34:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2021-11-09 09:34:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.1067961165048543) internal successors, (114), 106 states have internal predecessors, (114), 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:34:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2021-11-09 09:34:51,349 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 36 [2021-11-09 09:34:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:51,350 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2021-11-09 09:34:51,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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:34:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2021-11-09 09:34:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 09:34:51,351 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:51,351 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:34:51,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 09:34:51,351 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-09 09:34:51,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:51,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539083629] [2021-11-09 09:34:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:51,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:51,858 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:34:51,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:51,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539083629] [2021-11-09 09:34:51,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539083629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:51,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:51,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:34:51,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193213997] [2021-11-09 09:34:51,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:34:51,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:34:51,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:34:51,860 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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:34:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:34:56,430 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2021-11-09 09:34:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:34:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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:34:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:34:56,432 INFO L225 Difference]: With dead ends: 107 [2021-11-09 09:34:56,432 INFO L226 Difference]: Without dead ends: 105 [2021-11-09 09:34:56,432 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:34:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-09 09:34:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-09 09:34:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 104 states have internal predecessors, (112), 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:34:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-11-09 09:34:56,439 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 38 [2021-11-09 09:34:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:34:56,439 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-11-09 09:34:56,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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:34:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-11-09 09:34:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 09:34:56,440 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:34:56,440 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:34:56,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 09:34:56,441 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:34:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:34:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2021-11-09 09:34:56,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:34:56,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711830713] [2021-11-09 09:34:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:34:56,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:34:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:34:56,960 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:34:56,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:34:56,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711830713] [2021-11-09 09:34:56,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711830713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:34:56,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:34:56,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:34:56,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698599965] [2021-11-09 09:34:56,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:34:56,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:34:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:34:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:34:56,961 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:35:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:03,699 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2021-11-09 09:35:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:35:03,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:35:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:03,701 INFO L225 Difference]: With dead ends: 134 [2021-11-09 09:35:03,701 INFO L226 Difference]: Without dead ends: 108 [2021-11-09 09:35:03,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:35:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-09 09:35:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2021-11-09 09:35:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 103 states have internal predecessors, (110), 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:35:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2021-11-09 09:35:03,707 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 38 [2021-11-09 09:35:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:03,707 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2021-11-09 09:35:03,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:35:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2021-11-09 09:35:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-09 09:35:03,708 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:03,708 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] [2021-11-09 09:35:03,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 09:35:03,709 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:35:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-09 09:35:03,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:03,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366076355] [2021-11-09 09:35:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:03,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:04,150 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:35:04,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:04,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366076355] [2021-11-09 09:35:04,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366076355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:04,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:04,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:35:04,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406245888] [2021-11-09 09:35:04,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:35:04,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:35:04,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:35:04,152 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:35:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:08,720 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-11-09 09:35:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:35:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 41 [2021-11-09 09:35:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:08,722 INFO L225 Difference]: With dead ends: 136 [2021-11-09 09:35:08,722 INFO L226 Difference]: Without dead ends: 75 [2021-11-09 09:35:08,723 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:35:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-09 09:35:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-11-09 09:35:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 74 states have internal predecessors, (78), 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:35:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-11-09 09:35:08,728 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 41 [2021-11-09 09:35:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:08,728 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-11-09 09:35:08,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:35:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-11-09 09:35:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-09 09:35:08,729 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:08,729 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] [2021-11-09 09:35:08,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 09:35:08,730 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:35:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1444386363, now seen corresponding path program 1 times [2021-11-09 09:35:08,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:08,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505701804] [2021-11-09 09:35:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:08,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:11,228 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:35:11,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:11,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505701804] [2021-11-09 09:35:11,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505701804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:11,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:11,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 09:35:11,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95380263] [2021-11-09 09:35:11,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 09:35:11,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 09:35:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:35:11,230 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:35:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:16,250 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2021-11-09 09:35:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:35:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 42 [2021-11-09 09:35:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:16,252 INFO L225 Difference]: With dead ends: 102 [2021-11-09 09:35:16,252 INFO L226 Difference]: Without dead ends: 61 [2021-11-09 09:35:16,252 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:35:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-09 09:35:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-09 09:35:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 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:35:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2021-11-09 09:35:16,256 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 42 [2021-11-09 09:35:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:16,256 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2021-11-09 09:35:16,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:35:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2021-11-09 09:35:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-09 09:35:16,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:16,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:16,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 09:35:16,258 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:35:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 832606961, now seen corresponding path program 1 times [2021-11-09 09:35:16,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:16,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986022422] [2021-11-09 09:35:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:16,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:18,874 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:35:18,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:18,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986022422] [2021-11-09 09:35:18,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986022422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:18,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:18,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:35:18,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319797157] [2021-11-09 09:35:18,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:35:18,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:35:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:35:18,876 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 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:35:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:23,584 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2021-11-09 09:35:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:35:23,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 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) Word has length 53 [2021-11-09 09:35:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:23,585 INFO L225 Difference]: With dead ends: 61 [2021-11-09 09:35:23,586 INFO L226 Difference]: Without dead ends: 59 [2021-11-09 09:35:23,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:35:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-09 09:35:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-09 09:35:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0) internal successors, (58), 58 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:35:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 58 transitions. [2021-11-09 09:35:23,590 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 58 transitions. Word has length 53 [2021-11-09 09:35:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:23,591 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 58 transitions. [2021-11-09 09:35:23,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 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:35:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 58 transitions. [2021-11-09 09:35:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-09 09:35:23,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:23,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:23,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 09:35:23,593 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-09 09:35:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2072414125, now seen corresponding path program 1 times [2021-11-09 09:35:23,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:23,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791339071] [2021-11-09 09:35:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:23,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:28,071 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:35:28,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:28,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791339071] [2021-11-09 09:35:28,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791339071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:28,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:28,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 09:35:28,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705940977] [2021-11-09 09:35:28,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 09:35:28,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 09:35:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:35:28,073 INFO L87 Difference]: Start difference. First operand 59 states and 58 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 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:35:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:32,894 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2021-11-09 09:35:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:35:32,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 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) Word has length 58 [2021-11-09 09:35:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:32,895 INFO L225 Difference]: With dead ends: 59 [2021-11-09 09:35:32,897 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 09:35:32,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-09 09:35:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 09:35:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 09:35:32,898 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:35:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 09:35:32,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2021-11-09 09:35:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:32,898 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 09:35:32,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 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:35:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 09:35:32,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 09:35:32,900 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,901 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,901 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,901 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,902 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:32,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 09:35:32,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-09 09:35:32,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:32,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:32,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:32,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:32,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:32,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:35,168 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,169 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-09 09:35:35,169 INFO L857 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2021-11-09 09:35:35,169 INFO L857 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2021-11-09 09:35:35,169 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,170 INFO L853 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0)) (.cse1 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.offset| 0)) (.cse4 (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity 18446744073709551616))))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) (.cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.len| 0)) (.cse10 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.base| 0))) (or (and (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base|) .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) 18446744073709551616)))) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base| 0) .cse11))) [2021-11-09 09:35:35,170 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:35:35,170 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:35:35,170 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:35:35,171 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:35:35,171 INFO L857 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2021-11-09 09:35:35,171 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:35:35,171 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 7101 7111) no Hoare annotation was computed. [2021-11-09 09:35:35,171 INFO L857 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-09 09:35:35,171 INFO L860 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2021-11-09 09:35:35,171 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,172 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,173 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,173 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,173 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,173 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,173 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,173 INFO L857 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,174 INFO L857 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,174 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,174 INFO L857 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-09 09:35:35,174 INFO L857 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-09 09:35:35,174 INFO L857 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,174 INFO L857 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,175 INFO L857 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-09 09:35:35,175 INFO L857 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-09 09:35:35,175 INFO L857 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,175 INFO L857 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,175 INFO L857 garLoopResultBuilder]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2021-11-09 09:35:35,175 INFO L857 garLoopResultBuilder]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,176 INFO L853 garLoopResultBuilder]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 24)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 0)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base| 0))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse4 (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity 18446744073709551616))))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|)) (.cse7 (= (select .cse20 .cse19) 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|) (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 16)))) (.cse9 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse13 (= 0 (select .cse20 .cse18))) (.cse14 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse15 (select .cse17 .cse19)) (.cse16 (= (select .cse17 .cse18) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 0) .cse16) (and (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse1 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div (+ ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (- 1)) 18446744073709551616)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base .cse15) .cse16 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0))))) [2021-11-09 09:35:35,176 INFO L857 garLoopResultBuilder]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2021-11-09 09:35:35,176 INFO L857 garLoopResultBuilder]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2021-11-09 09:35:35,176 INFO L857 garLoopResultBuilder]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2021-11-09 09:35:35,176 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,177 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-09 09:35:35,177 INFO L857 garLoopResultBuilder]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,177 INFO L857 garLoopResultBuilder]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,177 INFO L853 garLoopResultBuilder]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse19 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 24)) (.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 8)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.offset| 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 (select .cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 16)))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) (.cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0))) (.cse9 (= (select .cse20 .cse24) 0)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse1 (select .cse23 .cse24)) (.cse11 (= (select .cse23 .cse21) 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.len| 0)) (.cse14 (= (select .cse19 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.base| 0)) (.cse16 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset|) 0)) (.cse17 (= (select .cse20 .cse21) 0))) (or (and .cse0 (= .cse1 0) .cse2 .cse3 .cse4 (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity 18446744073709551616)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base| 0) .cse15 .cse16 .cse17) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base|) .cse2 (let ((.cse18 (select .cse19 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)))) (<= .cse18 (+ (* 18446744073709551616 (div (+ (- 1) .cse18) 18446744073709551616)) 36028797018963967))) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) 18446744073709551616)))) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base .cse1) .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0) .cse15 .cse16 .cse17)))) [2021-11-09 09:35:35,178 INFO L857 garLoopResultBuilder]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,178 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-09 09:35:35,178 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-09 09:35:35,178 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-09 09:35:35,178 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,178 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-09 09:35:35,179 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-09 09:35:35,179 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-09 09:35:35,179 INFO L857 garLoopResultBuilder]: For program point L8222(lines 8222 8223) no Hoare annotation was computed. [2021-11-09 09:35:35,179 INFO L857 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-09 09:35:35,179 INFO L857 garLoopResultBuilder]: For program point L8222-2(lines 8222 8223) no Hoare annotation was computed. [2021-11-09 09:35:35,179 INFO L857 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,180 INFO L857 garLoopResultBuilder]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,181 INFO L857 garLoopResultBuilder]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,181 INFO L857 garLoopResultBuilder]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,181 INFO L857 garLoopResultBuilder]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,181 INFO L857 garLoopResultBuilder]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2021-11-09 09:35:35,181 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,181 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_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) [2021-11-09 09:35:35,182 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-09 09:35:35,182 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 09:35:35,182 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 8)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse6 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 24))) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 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_buf_from_empty_array_harness_~array~0.base |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base|) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.offset| 0) (let ((.cse0 (select .cse1 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.offset| 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 (select .cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 16))) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) (= ULTIMATE.start_assert_bytes_match_~a.offset 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0)) (= (select .cse3 .cse4) 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base (select .cse5 .cse4)) (= (select .cse5 .cse6) 0) (not (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base 0)) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.len| 0) (= (select .cse1 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.base| 0) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset|) 0) (= (select .cse3 .cse6) 0))) [2021-11-09 09:35:35,186 INFO L731 BasicCegarLoop]: Path program 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:35:35,187 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:35:35,198 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,199 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,199 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,201 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,222 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,222 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,223 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,224 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,224 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,225 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,226 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,226 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,226 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,227 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,230 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,231 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,232 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,233 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,234 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,237 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,238 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,239 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,240 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:35,241 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:35,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:35,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:35:35 BoogieIcfgContainer [2021-11-09 09:35:35,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:35:35,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:35:35,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:35:35,245 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:35:35,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:33:48" (3/4) ... [2021-11-09 09:35:35,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 09:35:35,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2021-11-09 09:35:35,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-11-09 09:35:35,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-09 09:35:35,277 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-09 09:35:35,279 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-09 09:35:35,281 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-09 09:35:35,283 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-09 09:35:35,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 09:35:35,317 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && capacity == size [2021-11-09 09:35:35,318 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((buf == 0 && buf == 0) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((array == bytes && buf == 0) && \result == 0) && buf == 0) && !(\result == 0)) && capacity <= 36028797018963967 + 18446744073709551616 * ((capacity + -1) / 18446744073709551616)) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && bytes == 0) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) [2021-11-09 09:35:35,318 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((array == bytes && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) || ((((((((((((buf == 0 && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) [2021-11-09 09:35:35,319 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((buf == 0 && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) [2021-11-09 09:35:35,319 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && 1 <= cond) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && a == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && !(bytes == 0)) && a == b) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && b == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0 [2021-11-09 09:35:36,156 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:35:36,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:35:36,157 INFO L168 Benchmark]: Toolchain (without parser) took 123533.40 ms. Allocated memory was 88.1 MB in the beginning and 792.7 MB in the end (delta: 704.6 MB). Free memory was 44.0 MB in the beginning and 624.1 MB in the end (delta: -580.2 MB). Peak memory consumption was 518.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,158 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 88.1 MB. Free memory was 58.1 MB in the beginning and 58.1 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:35:36,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3892.80 ms. Allocated memory was 88.1 MB in the beginning and 172.0 MB in the end (delta: 83.9 MB). Free memory was 43.7 MB in the beginning and 82.6 MB in the end (delta: -38.9 MB). Peak memory consumption was 52.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 313.79 ms. Allocated memory is still 172.0 MB. Free memory was 82.6 MB in the beginning and 114.8 MB in the end (delta: -32.3 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,159 INFO L168 Benchmark]: Boogie Preprocessor took 143.02 ms. Allocated memory is still 172.0 MB. Free memory was 114.8 MB in the beginning and 107.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,159 INFO L168 Benchmark]: RCFGBuilder took 11811.59 ms. Allocated memory was 172.0 MB in the beginning and 260.0 MB in the end (delta: 88.1 MB). Free memory was 107.4 MB in the beginning and 93.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,160 INFO L168 Benchmark]: TraceAbstraction took 106452.02 ms. Allocated memory was 260.0 MB in the beginning and 792.7 MB in the end (delta: 532.7 MB). Free memory was 93.1 MB in the beginning and 502.5 MB in the end (delta: -409.4 MB). Peak memory consumption was 123.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,160 INFO L168 Benchmark]: Witness Printer took 911.84 ms. Allocated memory is still 792.7 MB. Free memory was 502.5 MB in the beginning and 624.1 MB in the end (delta: -121.7 MB). Peak memory consumption was 272.7 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:36,162 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.31 ms. Allocated memory is still 88.1 MB. Free memory was 58.1 MB in the beginning and 58.1 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3892.80 ms. Allocated memory was 88.1 MB in the beginning and 172.0 MB in the end (delta: 83.9 MB). Free memory was 43.7 MB in the beginning and 82.6 MB in the end (delta: -38.9 MB). Peak memory consumption was 52.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 313.79 ms. Allocated memory is still 172.0 MB. Free memory was 82.6 MB in the beginning and 114.8 MB in the end (delta: -32.3 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 143.02 ms. Allocated memory is still 172.0 MB. Free memory was 114.8 MB in the beginning and 107.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 11811.59 ms. Allocated memory was 172.0 MB in the beginning and 260.0 MB in the end (delta: 88.1 MB). Free memory was 107.4 MB in the beginning and 93.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 106452.02 ms. Allocated memory was 260.0 MB in the beginning and 792.7 MB in the end (delta: 532.7 MB). Free memory was 93.1 MB in the beginning and 502.5 MB in the end (delta: -409.4 MB). Peak memory consumption was 123.3 MB. Max. memory is 16.1 GB. * Witness Printer took 911.84 ms. Allocated memory is still 792.7 MB. Free memory was 502.5 MB in the beginning and 624.1 MB in the end (delta: -121.7 MB). Peak memory consumption was 272.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - 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$.offset - 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$.offset - 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$.offset - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 - 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, 78 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 106.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 70.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1772 SDtfs, 2442 SDslu, 4624 SDs, 0 SdLazy, 1848 SolverSat, 139 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 63.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=17, InterpolantAutomatonStates: 173, 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, 24 MinimizatonAttempts, 352 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 804 HoareAnnotationTreeSize, 6 FomulaSimplifications, 2748 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 571 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 24.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 5534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 7 specifications checked. All of them hold - InvariantResult [Line: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 266]: Loop Invariant [2021-11-09 09:35:36,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,195 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,195 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,195 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,195 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,196 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,196 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,196 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,196 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && 1 <= cond) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && a == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && !(bytes == 0)) && a == b) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && b == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0 - InvariantResult [Line: 7375]: Loop Invariant [2021-11-09 09:35:36,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,197 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,198 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((buf == 0 && buf == 0) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((array == bytes && buf == 0) && \result == 0) && buf == 0) && !(\result == 0)) && capacity <= 36028797018963967 + 18446744073709551616 * ((capacity + -1) / 18446744073709551616)) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && bytes == 0) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) - InvariantResult [Line: 8218]: Loop Invariant [2021-11-09 09:35:36,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,202 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,203 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,204 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,205 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((array == bytes && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) || ((((((((((((buf == 0 && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && capacity == size - InvariantResult [Line: 7375]: Loop Invariant [2021-11-09 09:35:36,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,207 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,208 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,209 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,211 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,212 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,212 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,212 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,213 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,213 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 09:35:36,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 09:35:36,214 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-09 09:35:36,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((buf == 0 && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) RESULT: Ultimate proved your program to be correct! [2021-11-09 09:35:36,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b702fa71-5283-4638-a67f-0df36f6442a5/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