./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:24:20,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:24:20,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:24:20,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:24:20,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:24:20,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:24:20,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:24:20,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:24:20,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:24:20,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:24:20,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:24:20,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:24:20,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:24:20,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:24:20,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:24:20,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:24:20,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:24:20,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:24:20,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:24:20,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:24:20,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:24:20,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:24:20,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:24:20,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:24:20,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:24:20,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:24:20,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:24:20,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:24:20,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:24:20,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:24:20,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:24:20,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:24:20,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:24:20,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:24:20,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:24:20,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:24:20,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:24:20,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:24:20,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:24:20,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:24:20,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:24:20,162 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-06 20:24:20,178 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:24:20,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:24:20,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:24:20,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:24:20,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:24:20,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:24:20,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:24:20,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:24:20,180 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:24:20,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:24:20,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:24:20,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:24:20,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:24:20,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:24:20,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:24:20,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:24:20,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:24:20,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:24:20,183 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_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/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_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2021-12-06 20:24:20,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:24:20,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:24:20,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:24:20,383 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:24:20,383 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:24:20,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-12-06 20:24:20,426 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/data/176f50b7d/42043a6b7d9143f898a5933b8bb02c63/FLAG048ecfff0 [2021-12-06 20:24:20,983 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:24:20,983 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-12-06 20:24:21,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/data/176f50b7d/42043a6b7d9143f898a5933b8bb02c63/FLAG048ecfff0 [2021-12-06 20:24:21,477 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/data/176f50b7d/42043a6b7d9143f898a5933b8bb02c63 [2021-12-06 20:24:21,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:24:21,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:24:21,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:24:21,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:24:21,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:24:21,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:24:21" (1/1) ... [2021-12-06 20:24:21,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b786288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:21, skipping insertion in model container [2021-12-06 20:24:21,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:24:21" (1/1) ... [2021-12-06 20:24:21,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:24:21,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:24:21,762 WARN L230 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_3f93e14c-6103-46b2-a64a-db72515666b1/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-12-06 20:24:21,767 WARN L230 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_3f93e14c-6103-46b2-a64a-db72515666b1/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-12-06 20:24:22,542 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,542 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,543 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,543 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,544 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,555 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,555 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,557 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:22,857 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-06 20:24:22,858 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-06 20:24:22,858 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-06 20:24:22,859 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-06 20:24:22,860 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-06 20:24:22,861 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-06 20:24:22,861 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-06 20:24:22,862 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-06 20:24:22,862 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-06 20:24:22,862 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-06 20:24:23,006 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-06 20:24:23,082 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,082 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:24:23,187 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:24:23,200 WARN L230 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_3f93e14c-6103-46b2-a64a-db72515666b1/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2021-12-06 20:24:23,200 WARN L230 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_3f93e14c-6103-46b2-a64a-db72515666b1/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2021-12-06 20:24:23,223 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,224 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,224 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,224 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,225 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,229 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,229 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,230 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,230 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,250 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-06 20:24:23,251 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-06 20:24:23,251 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-06 20:24:23,252 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-06 20:24:23,253 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-06 20:24:23,253 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-06 20:24:23,253 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-06 20:24:23,254 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-06 20:24:23,254 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-06 20:24:23,254 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-06 20:24:23,267 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-06 20:24:23,301 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,301 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:24:23,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:24:23,502 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:24:23,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23 WrapperNode [2021-12-06 20:24:23,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:24:23,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:24:23,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:24:23,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:24:23,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,643 INFO L137 Inliner]: procedures = 690, calls = 2609, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 777 [2021-12-06 20:24:23,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:24:23,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:24:23,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:24:23,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:24:23,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:24:23,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:24:23,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:24:23,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:24:23,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (1/1) ... [2021-12-06 20:24:23,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:24:23,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:24:23,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:24:23,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:24:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-06 20:24:23,790 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-06 20:24:23,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 20:24:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 20:24:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 20:24:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 20:24:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 20:24:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:24:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 20:24:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:24:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:24:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-06 20:24:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-06 20:24:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 20:24:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 20:24:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 20:24:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 20:24:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-06 20:24:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-06 20:24:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-06 20:24:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 20:24:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:24:23,974 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:24:23,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:24:24,878 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:24:24,885 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:24:24,885 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 20:24:24,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:24:24 BoogieIcfgContainer [2021-12-06 20:24:24,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:24:24,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:24:24,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:24:24,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:24:24,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:24:21" (1/3) ... [2021-12-06 20:24:24,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546b7692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:24:24, skipping insertion in model container [2021-12-06 20:24:24,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:24:23" (2/3) ... [2021-12-06 20:24:24,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546b7692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:24:24, skipping insertion in model container [2021-12-06 20:24:24,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:24:24" (3/3) ... [2021-12-06 20:24:24,895 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-12-06 20:24:24,900 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:24:24,900 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 20:24:24,943 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:24:24,948 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-12-06 20:24:24,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 20:24:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-06 20:24:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 20:24:24,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:24,966 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:24,966 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2021-12-06 20:24:24,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:24,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584420702] [2021-12-06 20:24:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:24,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:25,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:25,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584420702] [2021-12-06 20:24:25,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584420702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:25,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:25,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:24:25,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120387452] [2021-12-06 20:24:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:25,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:24:25,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:24:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:24:25,425 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:24:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:25,535 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-12-06 20:24:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:24:25,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-12-06 20:24:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:25,546 INFO L225 Difference]: With dead ends: 117 [2021-12-06 20:24:25,546 INFO L226 Difference]: Without dead ends: 54 [2021-12-06 20:24:25,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:24:25,553 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:25,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:24:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-06 20:24:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-06 20:24:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 20:24:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-06 20:24:25,598 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2021-12-06 20:24:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:25,598 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-06 20:24:25,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:24:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-06 20:24:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 20:24:25,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:25,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:25,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:24:25,601 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2021-12-06 20:24:25,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:25,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632476076] [2021-12-06 20:24:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:25,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:25,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:25,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632476076] [2021-12-06 20:24:25,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632476076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:25,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:25,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:24:25,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757658264] [2021-12-06 20:24:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:25,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:24:25,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:24:25,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:24:25,841 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:24:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:26,010 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2021-12-06 20:24:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:24:26,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-12-06 20:24:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:26,013 INFO L225 Difference]: With dead ends: 99 [2021-12-06 20:24:26,013 INFO L226 Difference]: Without dead ends: 57 [2021-12-06 20:24:26,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:24:26,015 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:26,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:24:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-06 20:24:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-06 20:24:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-06 20:24:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2021-12-06 20:24:26,025 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2021-12-06 20:24:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:26,025 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2021-12-06 20:24:26,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:24:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2021-12-06 20:24:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 20:24:26,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:26,027 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:26,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:24:26,027 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:26,027 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2021-12-06 20:24:26,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:26,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670561816] [2021-12-06 20:24:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:26,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:26,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:26,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670561816] [2021-12-06 20:24:26,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670561816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:26,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:26,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:24:26,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152371045] [2021-12-06 20:24:26,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:26,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:24:26,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:24:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:24:26,284 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:26,495 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-12-06 20:24:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:24:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2021-12-06 20:24:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:26,497 INFO L225 Difference]: With dead ends: 69 [2021-12-06 20:24:26,497 INFO L226 Difference]: Without dead ends: 67 [2021-12-06 20:24:26,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:24:26,499 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:26,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 287 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-06 20:24:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-12-06 20:24:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-06 20:24:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2021-12-06 20:24:26,510 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2021-12-06 20:24:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:26,510 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2021-12-06 20:24:26,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2021-12-06 20:24:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 20:24:26,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:26,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:26,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:24:26,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2021-12-06 20:24:26,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:26,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574933791] [2021-12-06 20:24:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:26,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:26,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:26,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574933791] [2021-12-06 20:24:26,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574933791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:26,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:26,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:24:26,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831572000] [2021-12-06 20:24:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:26,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:24:26,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:24:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:24:26,968 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 20:24:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:27,261 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2021-12-06 20:24:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:24:27,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2021-12-06 20:24:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:27,263 INFO L225 Difference]: With dead ends: 127 [2021-12-06 20:24:27,263 INFO L226 Difference]: Without dead ends: 78 [2021-12-06 20:24:27,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:24:27,266 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:27,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 262 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-06 20:24:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2021-12-06 20:24:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-06 20:24:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2021-12-06 20:24:27,277 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2021-12-06 20:24:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:27,277 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2021-12-06 20:24:27,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 20:24:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2021-12-06 20:24:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 20:24:27,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:27,279 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:27,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:24:27,279 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2021-12-06 20:24:27,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078202610] [2021-12-06 20:24:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:27,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:27,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078202610] [2021-12-06 20:24:27,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078202610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:27,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:27,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:24:27,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341448412] [2021-12-06 20:24:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:27,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:24:27,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:24:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:24:27,528 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:27,669 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2021-12-06 20:24:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:24:27,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2021-12-06 20:24:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:27,670 INFO L225 Difference]: With dead ends: 121 [2021-12-06 20:24:27,670 INFO L226 Difference]: Without dead ends: 68 [2021-12-06 20:24:27,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-12-06 20:24:27,671 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:27,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:24:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-06 20:24:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-06 20:24:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-06 20:24:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2021-12-06 20:24:27,678 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2021-12-06 20:24:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:27,678 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2021-12-06 20:24:27,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2021-12-06 20:24:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 20:24:27,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:27,680 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:27,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:24:27,680 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2021-12-06 20:24:27,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:27,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127618376] [2021-12-06 20:24:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:27,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:27,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127618376] [2021-12-06 20:24:27,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127618376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:27,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:27,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:24:27,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24204819] [2021-12-06 20:24:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:27,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:24:27,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:24:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:24:27,879 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:28,127 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-12-06 20:24:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:24:28,127 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-06 20:24:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:28,129 INFO L225 Difference]: With dead ends: 82 [2021-12-06 20:24:28,129 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 20:24:28,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:24:28,130 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:28,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 359 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 20:24:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2021-12-06 20:24:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 51 states have internal predecessors, (53), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-06 20:24:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-12-06 20:24:28,141 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2021-12-06 20:24:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:28,141 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-06 20:24:28,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-12-06 20:24:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 20:24:28,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:28,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:28,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:24:28,143 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2021-12-06 20:24:28,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:28,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645150086] [2021-12-06 20:24:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:28,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:28,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:28,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645150086] [2021-12-06 20:24:28,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645150086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:28,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:28,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 20:24:28,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674311139] [2021-12-06 20:24:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:28,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:24:28,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:24:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:24:28,422 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:28,832 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-12-06 20:24:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:24:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-06 20:24:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:28,834 INFO L225 Difference]: With dead ends: 81 [2021-12-06 20:24:28,834 INFO L226 Difference]: Without dead ends: 79 [2021-12-06 20:24:28,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-06 20:24:28,835 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:28,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 424 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-06 20:24:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-12-06 20:24:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-06 20:24:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-12-06 20:24:28,843 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2021-12-06 20:24:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:28,843 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-12-06 20:24:28,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:24:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-12-06 20:24:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 20:24:28,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:28,845 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:28,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:24:28,845 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2021-12-06 20:24:28,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:28,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862878195] [2021-12-06 20:24:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:28,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:24:29,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862878195] [2021-12-06 20:24:29,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862878195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:29,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:29,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:24:29,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459747287] [2021-12-06 20:24:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:29,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:24:29,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:24:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:24:29,060 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:24:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:29,179 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-12-06 20:24:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:24:29,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2021-12-06 20:24:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:29,181 INFO L225 Difference]: With dead ends: 91 [2021-12-06 20:24:29,181 INFO L226 Difference]: Without dead ends: 63 [2021-12-06 20:24:29,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:24:29,182 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:29,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:24:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-06 20:24:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-06 20:24:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-06 20:24:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-12-06 20:24:29,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2021-12-06 20:24:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:29,189 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-12-06 20:24:29,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:24:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-12-06 20:24:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-06 20:24:29,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:29,191 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:29,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:24:29,191 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2021-12-06 20:24:29,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:29,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749317253] [2021-12-06 20:24:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:29,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 20:24:29,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749317253] [2021-12-06 20:24:29,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749317253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:29,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:29,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:24:29,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627412077] [2021-12-06 20:24:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:29,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:24:29,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:29,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:24:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:24:29,399 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:24:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:29,590 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-12-06 20:24:29,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:24:29,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2021-12-06 20:24:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:29,592 INFO L225 Difference]: With dead ends: 75 [2021-12-06 20:24:29,592 INFO L226 Difference]: Without dead ends: 73 [2021-12-06 20:24:29,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:24:29,593 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:29,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 279 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:24:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-06 20:24:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-06 20:24:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-06 20:24:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-12-06 20:24:29,601 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2021-12-06 20:24:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:29,602 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-12-06 20:24:29,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:24:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-12-06 20:24:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 20:24:29,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:29,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:29,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:24:29,603 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2021-12-06 20:24:29,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:29,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922599043] [2021-12-06 20:24:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:29,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 20:24:29,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922599043] [2021-12-06 20:24:29,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922599043] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:24:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611676009] [2021-12-06 20:24:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:29,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:24:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:24:29,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:24:29,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:24:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:30,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-06 20:24:30,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:24:30,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 20:24:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:24:31,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:24:31,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611676009] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:24:31,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:24:31,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-12-06 20:24:31,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968124498] [2021-12-06 20:24:31,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:24:31,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 20:24:31,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:31,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 20:24:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-12-06 20:24:31,308 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-06 20:24:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:31,811 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-06 20:24:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 20:24:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2021-12-06 20:24:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:31,813 INFO L225 Difference]: With dead ends: 141 [2021-12-06 20:24:31,813 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 20:24:31,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2021-12-06 20:24:31,815 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:31,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 502 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 311 Unchecked, 0.3s Time] [2021-12-06 20:24:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 20:24:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2021-12-06 20:24:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-06 20:24:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2021-12-06 20:24:31,825 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 50 [2021-12-06 20:24:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:31,825 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2021-12-06 20:24:31,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-06 20:24:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2021-12-06 20:24:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-06 20:24:31,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:31,827 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:31,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:24:32,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 20:24:32,028 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2021-12-06 20:24:32,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42937426] [2021-12-06 20:24:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:32,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 20:24:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 20:24:32,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42937426] [2021-12-06 20:24:32,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42937426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:32,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:32,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:24:32,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343440900] [2021-12-06 20:24:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:32,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:24:32,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:24:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:24:32,392 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 20:24:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:32,676 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-06 20:24:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:24:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 52 [2021-12-06 20:24:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:32,677 INFO L225 Difference]: With dead ends: 103 [2021-12-06 20:24:32,677 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 20:24:32,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:24:32,678 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:32,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 20:24:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-06 20:24:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 15 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-06 20:24:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-12-06 20:24:32,687 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 52 [2021-12-06 20:24:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:32,687 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-12-06 20:24:32,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 20:24:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-12-06 20:24:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-06 20:24:32,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:32,688 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:32,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:24:32,688 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2021-12-06 20:24:32,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:32,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069971796] [2021-12-06 20:24:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:32,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 20:24:32,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:32,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069971796] [2021-12-06 20:24:32,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069971796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:32,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:32,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:24:32,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335518360] [2021-12-06 20:24:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:32,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:24:32,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:24:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:24:32,863 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:24:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:33,081 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-06 20:24:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:24:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-12-06 20:24:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:33,083 INFO L225 Difference]: With dead ends: 121 [2021-12-06 20:24:33,083 INFO L226 Difference]: Without dead ends: 119 [2021-12-06 20:24:33,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:24:33,084 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:33,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 350 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:24:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-06 20:24:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-12-06 20:24:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 84 states have internal predecessors, (85), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2021-12-06 20:24:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2021-12-06 20:24:33,093 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 52 [2021-12-06 20:24:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:33,094 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2021-12-06 20:24:33,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:24:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2021-12-06 20:24:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-06 20:24:33,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:33,095 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:33,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 20:24:33,095 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2021-12-06 20:24:33,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588534455] [2021-12-06 20:24:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:33,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 20:24:33,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:33,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588534455] [2021-12-06 20:24:33,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588534455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:33,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:33,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 20:24:33,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92046186] [2021-12-06 20:24:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:33,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:24:33,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:24:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:24:33,351 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:24:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:33,660 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-06 20:24:33,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:24:33,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-12-06 20:24:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:33,662 INFO L225 Difference]: With dead ends: 121 [2021-12-06 20:24:33,662 INFO L226 Difference]: Without dead ends: 119 [2021-12-06 20:24:33,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-06 20:24:33,663 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:33,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 425 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-06 20:24:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2021-12-06 20:24:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 72 states have internal predecessors, (75), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-06 20:24:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-06 20:24:33,671 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2021-12-06 20:24:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:33,671 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-06 20:24:33,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:24:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-06 20:24:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 20:24:33,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:33,673 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:33,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 20:24:33,673 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2021-12-06 20:24:33,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:33,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516284342] [2021-12-06 20:24:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:33,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:24:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:24:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 20:24:33,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516284342] [2021-12-06 20:24:33,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516284342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:24:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424958137] [2021-12-06 20:24:33,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:33,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:24:33,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:24:33,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:24:33,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:24:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 20:24:34,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:24:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 20:24:34,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:24:34,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424958137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:34,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:24:34,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-06 20:24:34,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306751761] [2021-12-06 20:24:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:34,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:24:34,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:34,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:24:34,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:24:34,216 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:24:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:34,318 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2021-12-06 20:24:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:24:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2021-12-06 20:24:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:34,320 INFO L225 Difference]: With dead ends: 169 [2021-12-06 20:24:34,320 INFO L226 Difference]: Without dead ends: 99 [2021-12-06 20:24:34,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:24:34,320 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:34,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 197 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2021-12-06 20:24:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-06 20:24:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-06 20:24:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 72 states have internal predecessors, (73), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-06 20:24:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-06 20:24:34,327 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 56 [2021-12-06 20:24:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:34,328 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-06 20:24:34,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:24:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-06 20:24:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 20:24:34,328 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:34,328 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:34,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 20:24:34,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-06 20:24:34,529 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2021-12-06 20:24:34,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:34,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062369265] [2021-12-06 20:24:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:34,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:24:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:24:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:24:34,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062369265] [2021-12-06 20:24:34,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062369265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:34,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:34,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 20:24:34,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748912604] [2021-12-06 20:24:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:34,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 20:24:34,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 20:24:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:24:34,903 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 20:24:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:35,149 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-06 20:24:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:24:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2021-12-06 20:24:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:35,150 INFO L225 Difference]: With dead ends: 127 [2021-12-06 20:24:35,150 INFO L226 Difference]: Without dead ends: 93 [2021-12-06 20:24:35,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-12-06 20:24:35,151 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:35,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 198 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-06 20:24:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-06 20:24:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 67 states have internal predecessors, (68), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2021-12-06 20:24:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-06 20:24:35,156 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 56 [2021-12-06 20:24:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:35,156 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-06 20:24:35,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 20:24:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-06 20:24:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 20:24:35,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:35,157 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:35,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 20:24:35,157 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2021-12-06 20:24:35,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:35,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425687710] [2021-12-06 20:24:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:35,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 20:24:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 20:24:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 20:24:35,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425687710] [2021-12-06 20:24:35,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425687710] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:35,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:35,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 20:24:35,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495982496] [2021-12-06 20:24:35,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:35,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 20:24:35,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 20:24:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:24:35,438 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:24:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:35,670 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-06 20:24:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:24:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2021-12-06 20:24:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:35,671 INFO L225 Difference]: With dead ends: 97 [2021-12-06 20:24:35,671 INFO L226 Difference]: Without dead ends: 93 [2021-12-06 20:24:35,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-12-06 20:24:35,672 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:35,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 218 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-06 20:24:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-06 20:24:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2021-12-06 20:24:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-12-06 20:24:35,678 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 59 [2021-12-06 20:24:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:35,678 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-12-06 20:24:35,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:24:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-12-06 20:24:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-06 20:24:35,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:35,679 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:35,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 20:24:35,679 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2021-12-06 20:24:35,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:35,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871199990] [2021-12-06 20:24:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:35,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 20:24:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 20:24:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-06 20:24:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 20:24:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-06 20:24:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-06 20:24:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 20:24:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-06 20:24:35,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:35,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871199990] [2021-12-06 20:24:35,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871199990] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:24:35,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622021370] [2021-12-06 20:24:35,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:35,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:24:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:24:35,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:24:35,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 20:24:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:36,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-06 20:24:36,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:24:36,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 20:24:36,841 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-06 20:24:36,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2021-12-06 20:24:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 20:24:36,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:24:38,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622021370] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:24:38,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:24:38,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-12-06 20:24:38,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601350666] [2021-12-06 20:24:38,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:24:38,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 20:24:38,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:38,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 20:24:38,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2021-12-06 20:24:38,402 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2021-12-06 20:24:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:38,981 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-12-06 20:24:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 20:24:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) Word has length 76 [2021-12-06 20:24:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:38,982 INFO L225 Difference]: With dead ends: 142 [2021-12-06 20:24:38,982 INFO L226 Difference]: Without dead ends: 68 [2021-12-06 20:24:38,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2021-12-06 20:24:38,983 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:38,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 439 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 525 Invalid, 0 Unknown, 206 Unchecked, 0.3s Time] [2021-12-06 20:24:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-06 20:24:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-06 20:24:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.0) internal successors, (47), 47 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 20:24:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-12-06 20:24:38,988 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2021-12-06 20:24:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:38,988 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-12-06 20:24:38,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2021-12-06 20:24:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-12-06 20:24:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-06 20:24:38,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:24:38,989 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:39,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 20:24:39,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 20:24:39,190 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:24:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:24:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2021-12-06 20:24:39,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:24:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534183513] [2021-12-06 20:24:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:24:39,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:24:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:24:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:24:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:24:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-06 20:24:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:24:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:24:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-06 20:24:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:24:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 20:24:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:24:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 20:24:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:24:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-06 20:24:40,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:24:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534183513] [2021-12-06 20:24:40,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534183513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:24:40,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:24:40,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 20:24:40,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356130268] [2021-12-06 20:24:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:24:40,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 20:24:40,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:24:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 20:24:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:24:40,053 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-06 20:24:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:24:40,354 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2021-12-06 20:24:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:24:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2021-12-06 20:24:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:24:40,355 INFO L225 Difference]: With dead ends: 68 [2021-12-06 20:24:40,355 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 20:24:40,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-12-06 20:24:40,355 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:24:40,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:24:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 20:24:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 20:24:40,356 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-12-06 20:24:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 20:24:40,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2021-12-06 20:24:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:24:40,356 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 20:24:40,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-06 20:24:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 20:24:40,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 20:24:40,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 20:24:40,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 20:24:40,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 20:24:41,380 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,380 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2021-12-06 20:24:41,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L854 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|))) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4) 0) .cse5 .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse9) .cse10) (and .cse0 .cse1 (not (= .cse9 0)) .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse3 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse10)))) [2021-12-06 20:24:41,382 INFO L854 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0) 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0)))) [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L854 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2021-12-06 20:24:41,382 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse4 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse8 (<= .cse13 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse10 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse13)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse12)) (.cse7 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (and .cse0 .cse1 (not (= .cse2 0)) .cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (let ((.cse5 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse6 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (or (and .cse4 .cse5 .cse6 .cse7) (and (or (not .cse4) (not .cse5)) (or (not .cse7) (not .cse6))))) .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse9 .cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse11) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse4 .cse1 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse8 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse12) 0) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse11 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse7)))) [2021-12-06 20:24:41,382 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse7 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (.cse6 (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse5 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse5)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| .cse7) .cse6)) (.cse4 (<= .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse14)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse13 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse5) 0) (< .cse6 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| .cse7 1)) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse10 .cse11 (= .cse12 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse13) (and .cse0 .cse1 (not (= .cse12 0)) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616))) .cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse3 .cse4 .cse8 .cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse10 .cse11 .cse13)))) [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-12-06 20:24:41,382 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-06 20:24:41,382 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L854 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse1 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (<= 0 (+ .cse3 (* 18446744073709551616 (div (* .cse3 (- 1)) 18446744073709551616)))) (= .cse3 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|))))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)))) [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-12-06 20:24:41,383 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-06 20:24:41,383 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-12-06 20:24:41,383 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-06 20:24:41,383 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8))) (or (and .cse0 .cse1 (not (= .cse2 0)) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse3 (= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse5 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse6 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) 0))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse6) (<= 0 (+ .cse6 (* 18446744073709551616 (div (* .cse6 (- 1)) 18446744073709551616))))))) .cse7) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8) 0) .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse4) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse7 (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-12-06 20:24:41,383 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse13 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse6 (<= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1| 1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse4)) (.cse12 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13))) (or (and .cse0 .cse1 .cse2 (not (= .cse3 0)) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616))) .cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse12) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse6 .cse7 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13) 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse12 (= .cse3 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2021-12-06 20:24:41,383 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-12-06 20:24:41,384 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-06 20:24:41,384 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-06 20:24:41,384 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-06 20:24:41,384 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-06 20:24:41,384 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-06 20:24:41,384 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-06 20:24:41,384 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-06 20:24:41,386 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:24:41,387 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 20:24:41,395 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:41,395 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:41,395 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:41,396 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:41,396 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:41,396 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:41,399 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:41,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:41,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:41,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:41,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:41,400 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:41,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:24:41 BoogieIcfgContainer [2021-12-06 20:24:41,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 20:24:41,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 20:24:41,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 20:24:41,402 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 20:24:41,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:24:24" (3/4) ... [2021-12-06 20:24:41,404 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 20:24:41,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-06 20:24:41,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-06 20:24:41,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-06 20:24:41,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-06 20:24:41,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-06 20:24:41,419 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-12-06 20:24:41,420 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-06 20:24:41,421 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-06 20:24:41,422 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-06 20:24:41,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-06 20:24:41,424 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-06 20:24:41,425 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-06 20:24:41,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 20:24:41,450 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && length <= len) && len <= length) && !(cur == 0)) && !(array == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] + 18446744073709551616 * (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] * -1 / 18446744073709551616) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] == unknown-#res!len-unknown)) || ((((((((((unknown-#res!len-unknown <= length && array == 0) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) && length <= unknown-#res!len-unknown) [2021-12-06 20:24:42,130 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 20:24:42,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 20:24:42,131 INFO L158 Benchmark]: Toolchain (without parser) took 20647.12ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 65.2MB in the beginning and 123.4MB in the end (delta: -58.3MB). Peak memory consumption was 197.5MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,131 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 111.1MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:24:42,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2016.38ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 65.0MB in the beginning and 56.5MB in the end (delta: 8.5MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.79ms. Allocated memory is still 134.2MB. Free memory was 56.5MB in the beginning and 80.7MB in the end (delta: -24.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,132 INFO L158 Benchmark]: Boogie Preprocessor took 75.06ms. Allocated memory is still 134.2MB. Free memory was 80.7MB in the beginning and 75.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,132 INFO L158 Benchmark]: RCFGBuilder took 1166.78ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 75.2MB in the beginning and 64.7MB in the end (delta: 10.5MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,132 INFO L158 Benchmark]: TraceAbstraction took 16512.13ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 63.7MB in the beginning and 109.3MB in the end (delta: -45.6MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,132 INFO L158 Benchmark]: Witness Printer took 729.13ms. Allocated memory is still 283.1MB. Free memory was 109.3MB in the beginning and 123.4MB in the end (delta: -14.1MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2021-12-06 20:24:42,134 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.12ms. Allocated memory is still 111.1MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2016.38ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 65.0MB in the beginning and 56.5MB in the end (delta: 8.5MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.79ms. Allocated memory is still 134.2MB. Free memory was 56.5MB in the beginning and 80.7MB in the end (delta: -24.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.06ms. Allocated memory is still 134.2MB. Free memory was 80.7MB in the beginning and 75.2MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1166.78ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 75.2MB in the beginning and 64.7MB in the end (delta: 10.5MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16512.13ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 63.7MB in the beginning and 109.3MB in the end (delta: -45.6MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 729.13ms. Allocated memory is still 283.1MB. Free memory was 109.3MB in the beginning and 123.4MB in the end (delta: -14.1MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 4815 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 534 IncrementalHoareTripleChecker+Unchecked, 3765 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4719 IncrementalHoareTripleChecker+Invalid, 5641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 1050 mSDtfsCounter, 4719 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 465 SyntacticMatches, 16 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=12, InterpolantAutomatonStates: 208, 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, 18 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 101 PreInvPairs, 125 NumberOfFragments, 1215 HoareAnnotationTreeSize, 101 FomulaSimplifications, 182 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 2148 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1025 ConstructedInterpolants, 44 QuantifiedInterpolants, 4609 SizeOfPredicates, 37 NumberOfNonLiveVariables, 7363 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 320/362 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2021-12-06 20:24:42,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:42,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:42,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:42,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:42,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:42,139 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:42,140 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:42,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:42,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:42,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-06 20:24:42,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-06 20:24:42,141 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: ((((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && length <= len) && len <= length) && !(cur == 0)) && !(array == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] + 18446744073709551616 * (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] * -1 / 18446744073709551616) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] == unknown-#res!len-unknown)) || ((((((((((unknown-#res!len-unknown <= length && array == 0) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) && length <= unknown-#res!len-unknown) RESULT: Ultimate proved your program to be correct! [2021-12-06 20:24:42,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f93e14c-6103-46b2-a64a-db72515666b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE