./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:30:32,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:32,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:32,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:32,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:32,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:32,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:32,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:32,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:32,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:32,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:32,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:32,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:32,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:32,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:32,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:32,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:32,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:32,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:32,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:32,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:32,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:32,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:32,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:32,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:32,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:32,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:32,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:32,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:32,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:32,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:32,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:32,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:32,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:32,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:32,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:32,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:32,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:32,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:32,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:32,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:32,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:30:32,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:32,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:32,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:32,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:32,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:32,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:32,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:32,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:32,181 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:32,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:32,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:32,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:32,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:30:32,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:32,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:30:32,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:32,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:32,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:30:32,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:32,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:32,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:32,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:32,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:32,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:32,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:30:32,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:32,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:32,186 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:30:32,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:30:32,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:30:32,187 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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 10:30:32,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:32,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:32,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:32,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:32,464 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:32,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2022-11-20 10:30:35,522 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:36,143 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:36,144 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2022-11-20 10:30:36,189 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/data/1993d7405/174ab93544f346de829210a22ee480f7/FLAGbdaed385c [2022-11-20 10:30:36,209 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/data/1993d7405/174ab93544f346de829210a22ee480f7 [2022-11-20 10:30:36,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:36,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:36,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:36,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:36,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:36,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:36" (1/1) ... [2022-11-20 10:30:36,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470b834e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:36, skipping insertion in model container [2022-11-20 10:30:36,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:36" (1/1) ... [2022-11-20 10:30:36,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:36,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:36,646 WARN L237 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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2022-11-20 10:30:36,656 WARN L237 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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2022-11-20 10:30:37,926 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,927 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,928 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,928 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,930 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,946 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,947 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,948 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:37,949 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:38,454 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:30:38,456 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:30:38,457 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:30:38,458 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:30:38,460 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:30:38,461 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:30:38,462 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:30:38,463 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:30:38,464 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:30:38,465 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:30:38,776 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:30:38,970 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:38,976 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:39,108 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:39,123 WARN L237 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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2022-11-20 10:30:39,123 WARN L237 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_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2022-11-20 10:30:39,160 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,161 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,161 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,162 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,163 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,169 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,170 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,171 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,171 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,222 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:30:39,223 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:30:39,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:30:39,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:30:39,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:30:39,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:30:39,227 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:30:39,230 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:30:39,231 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:30:39,231 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:30:39,266 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:30:39,359 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,359 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:30:39,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:39,687 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:39,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39 WrapperNode [2022-11-20 10:30:39,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:39,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:39,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:39,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:39,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,838 INFO L138 Inliner]: procedures = 690, calls = 2608, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 776 [2022-11-20 10:30:39,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:39,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:39,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:39,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:39,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,918 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:39,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:39,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:39,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:39,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (1/1) ... [2022-11-20 10:30:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:39,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:39,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:40,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:40,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-11-20 10:30:40,036 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-11-20 10:30:40,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:30:40,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:30:40,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 10:30:40,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 10:30:40,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:30:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:30:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:40,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-20 10:30:40,038 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-20 10:30:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:30:40,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:30:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:30:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:30:40,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:30:40,040 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-20 10:30:40,040 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-20 10:30:40,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:30:40,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:40,391 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:40,399 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:41,619 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:41,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:41,638 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:30:41,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:41 BoogieIcfgContainer [2022-11-20 10:30:41,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:41,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:41,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:41,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:41,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:36" (1/3) ... [2022-11-20 10:30:41,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fcc231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:41, skipping insertion in model container [2022-11-20 10:30:41,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:39" (2/3) ... [2022-11-20 10:30:41,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fcc231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:41, skipping insertion in model container [2022-11-20 10:30:41,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:41" (3/3) ... [2022-11-20 10:30:41,653 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2022-11-20 10:30:41,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:41,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:30:41,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:41,755 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3bad13b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:41,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:30:41,760 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) [2022-11-20 10:30:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:30:41,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:41,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:41,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2022-11-20 10:30:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076736714] [2022-11-20 10:30:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:42,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:42,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:42,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:42,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:42,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076736714] [2022-11-20 10:30:42,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076736714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:42,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:42,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107248145] [2022-11-20 10:30:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:42,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:30:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:42,577 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) [2022-11-20 10:30:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:42,900 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2022-11-20 10:30:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:42,903 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 [2022-11-20 10:30:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:42,911 INFO L225 Difference]: With dead ends: 117 [2022-11-20 10:30:42,912 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 10:30:42,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:42,925 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:42,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 62 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:30:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 10:30:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-20 10:30:42,971 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) [2022-11-20 10:30:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-11-20 10:30:42,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2022-11-20 10:30:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:42,979 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-11-20 10:30:42,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:30:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-11-20 10:30:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:30:42,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:42,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:42,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:42,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2022-11-20 10:30:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:42,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390625349] [2022-11-20 10:30:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:43,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390625349] [2022-11-20 10:30:43,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390625349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:43,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:43,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:43,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696862421] [2022-11-20 10:30:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:43,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:43,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:43,840 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) [2022-11-20 10:30:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:44,129 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2022-11-20 10:30:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:44,130 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 [2022-11-20 10:30:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:44,132 INFO L225 Difference]: With dead ends: 99 [2022-11-20 10:30:44,132 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 10:30:44,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:44,134 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:44,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 91 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:30:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 10:30:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-20 10:30:44,144 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) [2022-11-20 10:30:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2022-11-20 10:30:44,146 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2022-11-20 10:30:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:44,147 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2022-11-20 10:30:44,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:30:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-11-20 10:30:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 10:30:44,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:44,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:44,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:44,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2022-11-20 10:30:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:44,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412480225] [2022-11-20 10:30:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:45,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412480225] [2022-11-20 10:30:45,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412480225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:45,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:45,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:30:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444771302] [2022-11-20 10:30:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:45,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:45,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:45,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:45,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:45,223 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) [2022-11-20 10:30:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:45,666 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-20 10:30:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:45,667 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 [2022-11-20 10:30:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:45,669 INFO L225 Difference]: With dead ends: 69 [2022-11-20 10:30:45,669 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 10:30:45,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:30:45,671 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:45,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 197 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:30:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 10:30:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-20 10:30:45,680 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) [2022-11-20 10:30:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-11-20 10:30:45,682 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2022-11-20 10:30:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:45,683 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-11-20 10:30:45,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:30:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-11-20 10:30:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:30:45,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:45,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:45,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:30:45,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2022-11-20 10:30:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:45,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896746729] [2022-11-20 10:30:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896746729] [2022-11-20 10:30:47,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896746729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:47,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:47,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:30:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528678898] [2022-11-20 10:30:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:47,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:30:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:30:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:30:47,640 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) [2022-11-20 10:30:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:48,327 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-11-20 10:30:48,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:30:48,327 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 [2022-11-20 10:30:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:48,328 INFO L225 Difference]: With dead ends: 127 [2022-11-20 10:30:48,329 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 10:30:48,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:30:48,330 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:48,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 182 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:30:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 10:30:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2022-11-20 10:30:48,339 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) [2022-11-20 10:30:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-11-20 10:30:48,340 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2022-11-20 10:30:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:48,341 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-11-20 10:30:48,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:30:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-11-20 10:30:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:30:48,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:48,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:48,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:30:48,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:48,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2022-11-20 10:30:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:48,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542947173] [2022-11-20 10:30:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:50,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542947173] [2022-11-20 10:30:50,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542947173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:50,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:50,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:30:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761519993] [2022-11-20 10:30:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:50,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:50,038 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) [2022-11-20 10:30:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:50,300 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2022-11-20 10:30:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:50,301 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 [2022-11-20 10:30:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:50,302 INFO L225 Difference]: With dead ends: 121 [2022-11-20 10:30:50,302 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 10:30:50,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:50,303 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:50,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 93 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:30:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 10:30:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-20 10:30:50,315 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) [2022-11-20 10:30:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-11-20 10:30:50,316 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2022-11-20 10:30:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:50,318 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-11-20 10:30:50,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:30:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-11-20 10:30:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:30:50,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:50,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:50,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:30:50,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2022-11-20 10:30:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:50,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54559706] [2022-11-20 10:30:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54559706] [2022-11-20 10:30:51,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54559706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:51,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:51,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:30:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34715302] [2022-11-20 10:30:51,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:51,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:30:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:30:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:30:51,416 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) [2022-11-20 10:30:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:51,901 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-11-20 10:30:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:30:51,903 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 [2022-11-20 10:30:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:51,904 INFO L225 Difference]: With dead ends: 82 [2022-11-20 10:30:51,905 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:30:51,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:30:51,906 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:51,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 249 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:30:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:30:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-11-20 10:30:51,913 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) [2022-11-20 10:30:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2022-11-20 10:30:51,914 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2022-11-20 10:30:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:51,919 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2022-11-20 10:30:51,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:30:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2022-11-20 10:30:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:30:51,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:51,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:51,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:30:51,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2022-11-20 10:30:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900072791] [2022-11-20 10:30:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:30:53,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:53,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900072791] [2022-11-20 10:30:53,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900072791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:53,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:53,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:30:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278799671] [2022-11-20 10:30:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:53,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:30:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:30:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:30:53,552 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) [2022-11-20 10:30:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:54,226 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-11-20 10:30:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:30:54,226 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 [2022-11-20 10:30:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:54,228 INFO L225 Difference]: With dead ends: 81 [2022-11-20 10:30:54,228 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 10:30:54,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-11-20 10:30:54,229 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 77 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:54,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 290 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:30:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 10:30:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2022-11-20 10:30:54,236 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) [2022-11-20 10:30:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-11-20 10:30:54,237 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2022-11-20 10:30:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:54,237 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-11-20 10:30:54,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:30:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-11-20 10:30:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:30:54,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:54,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:54,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:30:54,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2022-11-20 10:30:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:54,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971998974] [2022-11-20 10:30:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:30:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:30:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971998974] [2022-11-20 10:30:54,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971998974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:54,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:54,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:30:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759301108] [2022-11-20 10:30:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:54,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:54,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:54,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:54,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:54,704 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) [2022-11-20 10:30:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:54,926 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-11-20 10:30:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:54,927 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 [2022-11-20 10:30:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:54,928 INFO L225 Difference]: With dead ends: 91 [2022-11-20 10:30:54,928 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:30:54,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:30:54,929 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:54,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 74 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:30:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:30:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 10:30:54,942 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) [2022-11-20 10:30:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-11-20 10:30:54,946 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2022-11-20 10:30:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:54,947 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-11-20 10:30:54,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:30:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-11-20 10:30:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 10:30:54,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:54,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:30:54,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2022-11-20 10:30:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:54,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039676431] [2022-11-20 10:30:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:30:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:30:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:30:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039676431] [2022-11-20 10:30:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039676431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:55,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:30:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753836946] [2022-11-20 10:30:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:55,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:55,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:55,699 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) [2022-11-20 10:30:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:56,034 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-11-20 10:30:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:56,035 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 [2022-11-20 10:30:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:56,036 INFO L225 Difference]: With dead ends: 75 [2022-11-20 10:30:56,036 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 10:30:56,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:30:56,037 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:56,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 196 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:30:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 10:30:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-11-20 10:30:56,048 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) [2022-11-20 10:30:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-11-20 10:30:56,051 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2022-11-20 10:30:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:56,051 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-11-20 10:30:56,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:30:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-11-20 10:30:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:30:56,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:56,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:56,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:30:56,053 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:30:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2022-11-20 10:30:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:56,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782184130] [2022-11-20 10:30:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:30:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:30:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:30:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:30:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:30:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:30:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:30:58,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:58,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782184130] [2022-11-20 10:30:58,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782184130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:58,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341580500] [2022-11-20 10:30:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:58,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:58,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:30:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:58,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 2420 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 10:30:58,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:58,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-20 10:31:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:14,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341580500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:14,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:14,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 24 [2022-11-20 10:31:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172778014] [2022-11-20 10:31:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:14,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:31:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:31:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=484, Unknown=2, NotChecked=0, Total=552 [2022-11-20 10:31:14,093 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:31:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:14,240 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-11-20 10:31:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:31:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-11-20 10:31:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:14,242 INFO L225 Difference]: With dead ends: 126 [2022-11-20 10:31:14,242 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:31:14,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=71, Invalid=527, Unknown=2, NotChecked=0, Total=600 [2022-11-20 10:31:14,244 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:14,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 415 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-11-20 10:31:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:31:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-11-20 10:31:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 15 states have call successors, (15), 10 states have call predecessors, (15), 11 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 10:31:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2022-11-20 10:31:14,256 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 50 [2022-11-20 10:31:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:14,256 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2022-11-20 10:31:14,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:31:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-11-20 10:31:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:31:14,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:14,257 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:14,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:14,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:31:14,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2022-11-20 10:31:14,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:14,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263136437] [2022-11-20 10:31:14,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:31:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:31:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:31:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:15,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263136437] [2022-11-20 10:31:15,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263136437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:15,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:15,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:31:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575523329] [2022-11-20 10:31:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:15,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:31:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:31:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:31:15,879 INFO L87 Difference]: Start difference. First operand 93 states and 105 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) [2022-11-20 10:31:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:16,399 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-11-20 10:31:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:31:16,400 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 [2022-11-20 10:31:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:16,402 INFO L225 Difference]: With dead ends: 99 [2022-11-20 10:31:16,402 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 10:31:16,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:31:16,403 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:16,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 106 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 10:31:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-20 10:31:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 71 states have internal predecessors, (75), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 10:31:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2022-11-20 10:31:16,419 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 52 [2022-11-20 10:31:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:16,419 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2022-11-20 10:31:16,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:31:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2022-11-20 10:31:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:31:16,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:16,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:16,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:31:16,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2022-11-20 10:31:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:16,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406793807] [2022-11-20 10:31:16,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:16,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:31:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:31:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:31:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:17,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406793807] [2022-11-20 10:31:17,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406793807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:17,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:17,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:31:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037190015] [2022-11-20 10:31:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:17,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:31:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:31:17,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:31:17,339 INFO L87 Difference]: Start difference. First operand 97 states and 108 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) [2022-11-20 10:31:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:17,779 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-11-20 10:31:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:31:17,780 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 [2022-11-20 10:31:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:17,781 INFO L225 Difference]: With dead ends: 111 [2022-11-20 10:31:17,781 INFO L226 Difference]: Without dead ends: 109 [2022-11-20 10:31:17,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:31:17,782 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:17,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 248 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:31:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-20 10:31:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-11-20 10:31:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 77 states have internal predecessors, (80), 15 states have call successors, (15), 11 states have call predecessors, (15), 13 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2022-11-20 10:31:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-11-20 10:31:17,799 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 52 [2022-11-20 10:31:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:17,799 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-11-20 10:31:17,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:31:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-11-20 10:31:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 10:31:17,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:17,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:17,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:31:17,801 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:17,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2022-11-20 10:31:17,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:17,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355539599] [2022-11-20 10:31:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:31:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:31:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 10:31:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:19,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355539599] [2022-11-20 10:31:19,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355539599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:19,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:19,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:31:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793742990] [2022-11-20 10:31:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:19,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:31:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:31:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:31:19,165 INFO L87 Difference]: Start difference. First operand 103 states and 116 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) [2022-11-20 10:31:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:20,082 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-11-20 10:31:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:31:20,083 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 [2022-11-20 10:31:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:20,084 INFO L225 Difference]: With dead ends: 111 [2022-11-20 10:31:20,084 INFO L226 Difference]: Without dead ends: 109 [2022-11-20 10:31:20,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-11-20 10:31:20,085 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:20,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 310 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:31:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-20 10:31:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-11-20 10:31:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 71 states have internal predecessors, (75), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 10:31:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2022-11-20 10:31:20,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 52 [2022-11-20 10:31:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,096 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2022-11-20 10:31:20,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:31:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2022-11-20 10:31:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:31:20,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,097 INFO L195 NwaCegarLoop]: 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] [2022-11-20 10:31:20,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:31:20,098 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2022-11-20 10:31:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217917808] [2022-11-20 10:31:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:31:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:31:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:31:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217917808] [2022-11-20 10:31:21,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217917808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:21,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376003928] [2022-11-20 10:31:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:21,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:21,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:21,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:31:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 2437 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:31:22,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:31:22,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:22,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376003928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:22,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:22,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-11-20 10:31:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958159353] [2022-11-20 10:31:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:22,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:22,436 INFO L87 Difference]: Start difference. First operand 97 states and 108 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) [2022-11-20 10:31:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:22,650 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2022-11-20 10:31:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:31:22,651 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 [2022-11-20 10:31:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:22,652 INFO L225 Difference]: With dead ends: 161 [2022-11-20 10:31:22,652 INFO L226 Difference]: Without dead ends: 97 [2022-11-20 10:31:22,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:31:22,653 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:22,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 195 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 18 Unchecked, 0.1s Time] [2022-11-20 10:31:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-20 10:31:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-20 10:31:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-20 10:31:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-11-20 10:31:22,664 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 56 [2022-11-20 10:31:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:22,664 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-11-20 10:31:22,664 INFO L496 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) [2022-11-20 10:31:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-11-20 10:31:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:31:22,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:22,666 INFO L195 NwaCegarLoop]: 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] [2022-11-20 10:31:22,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:22,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:31:22,876 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2022-11-20 10:31:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946193835] [2022-11-20 10:31:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:22,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:31:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:31:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:31:24,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946193835] [2022-11-20 10:31:24,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946193835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:24,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:24,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:31:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438120890] [2022-11-20 10:31:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:31:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:31:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:31:24,721 INFO L87 Difference]: Start difference. First operand 97 states and 107 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) [2022-11-20 10:31:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:25,478 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-11-20 10:31:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:31:25,480 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 [2022-11-20 10:31:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:25,481 INFO L225 Difference]: With dead ends: 125 [2022-11-20 10:31:25,481 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 10:31:25,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:31:25,482 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:25,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 146 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:31:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 10:31:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2022-11-20 10:31:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-20 10:31:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-11-20 10:31:25,502 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 56 [2022-11-20 10:31:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:25,503 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-11-20 10:31:25,503 INFO L496 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) [2022-11-20 10:31:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-11-20 10:31:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:31:25,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:25,504 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:25,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:31:25,505 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,505 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2022-11-20 10:31:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246186297] [2022-11-20 10:31:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:31:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:31:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-20 10:31:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 10:31:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:27,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246186297] [2022-11-20 10:31:27,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246186297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:27,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:27,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:31:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432077747] [2022-11-20 10:31:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:27,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:31:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:31:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:31:27,458 INFO L87 Difference]: Start difference. First operand 85 states and 92 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) [2022-11-20 10:31:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:28,043 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-20 10:31:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:31:28,044 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 [2022-11-20 10:31:28,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:28,045 INFO L225 Difference]: With dead ends: 91 [2022-11-20 10:31:28,045 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 10:31:28,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:31:28,046 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:28,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 126 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 10:31:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-20 10:31:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2022-11-20 10:31:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-20 10:31:28,057 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 59 [2022-11-20 10:31:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:28,057 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-20 10:31:28,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:31:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-20 10:31:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 10:31:28,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:28,059 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:28,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:31:28,059 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2022-11-20 10:31:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:28,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014537848] [2022-11-20 10:31:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 10:31:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:31:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-20 10:31:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:31:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-20 10:31:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:31:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 10:31:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014537848] [2022-11-20 10:31:30,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014537848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536501223] [2022-11-20 10:31:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:30,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:30,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:30,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:31:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:30,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 2494 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 10:31:30,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:30,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:31:31,796 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:31:31,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2022-11-20 10:31:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:31:31,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:32,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536501223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:32,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:31:32,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-11-20 10:31:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573838235] [2022-11-20 10:31:32,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:32,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 10:31:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 10:31:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:31:32,106 INFO L87 Difference]: Start difference. First operand 87 states and 93 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) [2022-11-20 10:31:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:33,487 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-20 10:31:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:31:33,487 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 [2022-11-20 10:31:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:33,488 INFO L225 Difference]: With dead ends: 151 [2022-11-20 10:31:33,488 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 10:31:33,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2022-11-20 10:31:33,490 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:33,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 419 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 551 Invalid, 0 Unknown, 249 Unchecked, 0.7s Time] [2022-11-20 10:31:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 10:31:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-11-20 10:31:33,500 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) [2022-11-20 10:31:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-11-20 10:31:33,501 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2022-11-20 10:31:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:33,502 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-11-20 10:31:33,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-20 10:31:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-11-20 10:31:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-20 10:31:33,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:33,503 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:33,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:31:33,704 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:31:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2022-11-20 10:31:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:33,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972411575] [2022-11-20 10:31:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:31:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:31:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 10:31:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:31:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:31:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:31:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:31:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:31:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:31:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-20 10:31:37,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:37,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972411575] [2022-11-20 10:31:37,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972411575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:37,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:37,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:31:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925732248] [2022-11-20 10:31:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:37,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:31:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:37,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:31:37,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:31:37,201 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) [2022-11-20 10:31:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:37,802 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-11-20 10:31:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:31:37,803 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 [2022-11-20 10:31:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:37,804 INFO L225 Difference]: With dead ends: 68 [2022-11-20 10:31:37,804 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:31:37,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:31:37,805 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:37,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 133 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:31:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:31:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:31:37,806 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) [2022-11-20 10:31:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:31:37,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-11-20 10:31:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:37,806 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:31:37,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 10:31:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:31:37,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:31:37,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:31:37,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:31:37,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:31:39,371 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-20 10:31:39,371 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-20 10:31:39,372 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-20 10:31:39,372 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-20 10:31:39,372 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-20 10:31:39,372 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-20 10:31:39,372 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-20 10:31:39,373 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 10:31:39,373 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-20 10:31:39,373 INFO L899 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,373 INFO L899 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,373 INFO L899 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,373 INFO L899 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,374 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2022-11-20 10:31:39,374 INFO L899 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,374 INFO L899 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,374 INFO L899 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,374 INFO L899 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,375 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2022-11-20 10:31:39,375 INFO L899 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,375 INFO L899 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2022-11-20 10:31:39,375 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2022-11-20 10:31:39,375 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-20 10:31:39,375 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-20 10:31:39,375 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-20 10:31:39,376 INFO L899 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2022-11-20 10:31:39,376 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:31:39,376 INFO L895 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse3 (+ |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|))) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse3)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse4 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1066#1| 1)) (.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~ret1066#1|))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse3) 0) .cse4 .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse6 .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 (not (= .cse9 0)) .cse1 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= |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))))))) [2022-11-20 10:31:39,376 INFO L895 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)))) [2022-11-20 10:31:39,377 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-20 10:31:39,377 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2022-11-20 10:31:39,377 INFO L899 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2022-11-20 10:31:39,377 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-20 10:31:39,378 INFO L895 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2022-11-20 10:31:39,378 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (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|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse0 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse9 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3) 0) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse7 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse9) (let ((.cse10 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse11 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (and (or (not .cse9) (and .cse0 .cse10) (not .cse11)) .cse1 (not (= .cse8 0)) .cse2 (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_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse4 .cse5 .cse6 .cse7 (or (not .cse0) (not .cse10) (and .cse11 .cse9))))))) [2022-11-20 10:31:39,378 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1202#1|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= (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|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse3) 0) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse7 (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (and .cse0 (not (= .cse8 0)) .cse1 (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)) .cse2 .cse4 .cse5 .cse6 .cse7 (<= |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))))))) [2022-11-20 10:31:39,379 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-20 10:31:39,379 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2022-11-20 10:31:39,379 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |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_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 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) (= (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|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |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_~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|) .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-11-20 10:31:39,379 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:31:39,380 INFO L895 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 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse4) (and .cse0 .cse1 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse5 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7| 8)))) (and (not (= .cse5 0)) (= .cse5 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base|)))) .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse6 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (<= .cse6 (* (div .cse6 18446744073709551616) 18446744073709551616)))))))) [2022-11-20 10:31:39,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:31:39,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:31:39,381 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-20 10:31:39,381 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2022-11-20 10:31:39,381 INFO L899 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2022-11-20 10:31:39,381 INFO L902 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2022-11-20 10:31:39,381 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |ULTIMATE.start_assert_bytes_match_#t~mem585#1| |ULTIMATE.start_assert_bytes_match_#t~mem584#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_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 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) (= (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|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |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_~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|) .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-11-20 10:31:39,382 INFO L902 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2022-11-20 10:31:39,382 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (= |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_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse0) 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) (= (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|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |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_~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|) .cse0) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2022-11-20 10:31:39,383 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse8 (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_harness_~#cur~3#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse10))) (or (and .cse0 .cse1 (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)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7| Int) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse2 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) (+ |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7| 8)))) (and (not (= .cse2 0)) (= .cse2 .cse3)))) .cse4 .cse5 .cse6 .cse7 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse9 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (= .cse8 .cse9) (<= .cse9 (* (div .cse9 18446744073709551616) 18446744073709551616)))))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse10) 0) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse7 (= .cse3 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2022-11-20 10:31:39,383 INFO L899 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2022-11-20 10:31:39,383 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse10 (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|)) (.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse4)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1201#1| 1)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1201#1|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse6 (= .cse10 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.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|))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse4) 0) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= .cse9 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (and .cse0 (not (= .cse9 0)) .cse1 (<= .cse10 (* 18446744073709551616 (div .cse10 18446744073709551616))) (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)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8)))) [2022-11-20 10:31:39,384 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2022-11-20 10:31:39,384 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-20 10:31:39,384 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-20 10:31:39,384 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-20 10:31:39,384 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-20 10:31:39,384 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-20 10:31:39,385 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-20 10:31:39,385 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-20 10:31:39,389 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:39,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:31:39,403 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:39,404 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:39,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:39,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:39,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:39,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:39,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:39,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:39,406 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:39,406 WARN L421 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] [2022-11-20 10:31:39,407 WARN L421 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] [2022-11-20 10:31:39,407 WARN L421 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] [2022-11-20 10:31:39,410 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:39,411 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:39,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:39,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:39,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:39,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:39,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:39,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:39,413 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:39,413 WARN L421 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] [2022-11-20 10:31:39,413 WARN L421 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] [2022-11-20 10:31:39,413 WARN L421 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] [2022-11-20 10:31:39,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:31:39 BoogieIcfgContainer [2022-11-20 10:31:39,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:31:39,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:31:39,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:31:39,417 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:31:39,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:41" (3/4) ... [2022-11-20 10:31:39,421 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:31:39,428 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-20 10:31:39,428 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-11-20 10:31:39,428 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-20 10:31:39,429 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 10:31:39,429 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 10:31:39,439 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-11-20 10:31:39,441 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-11-20 10:31:39,442 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-20 10:31:39,443 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-20 10:31:39,444 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 10:31:39,445 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:31:39,446 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:31:39,447 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:31:39,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((array == 0 && cur == 0) && length == unknown-#res!len-unknown) && 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) || (((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7 + 8] == 0) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7 + 8] == aws_byte_cursor_from_array_#res#1.ptr)) && !(cur == 0)) && !(array == 0)) && len == length) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] == unknown-#res!len-unknown && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] / 18446744073709551616 * 18446744073709551616)) [2022-11-20 10:31:40,116 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:31:40,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:31:40,117 INFO L158 Benchmark]: Toolchain (without parser) took 63902.99ms. Allocated memory was 159.4MB in the beginning and 721.4MB in the end (delta: 562.0MB). Free memory was 117.2MB in the beginning and 261.9MB in the end (delta: -144.7MB). Peak memory consumption was 419.0MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,117 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 159.4MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:31:40,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3468.76ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 117.2MB in the beginning and 129.9MB in the end (delta: -12.7MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.45ms. Allocated memory is still 222.3MB. Free memory was 129.9MB in the beginning and 118.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,118 INFO L158 Benchmark]: Boogie Preprocessor took 102.84ms. Allocated memory is still 222.3MB. Free memory was 118.4MB in the beginning and 112.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,119 INFO L158 Benchmark]: RCFGBuilder took 1698.22ms. Allocated memory was 222.3MB in the beginning and 283.1MB in the end (delta: 60.8MB). Free memory was 112.1MB in the beginning and 190.3MB in the end (delta: -78.2MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,119 INFO L158 Benchmark]: TraceAbstraction took 57771.87ms. Allocated memory was 283.1MB in the beginning and 721.4MB in the end (delta: 438.3MB). Free memory was 189.2MB in the beginning and 390.9MB in the end (delta: -201.7MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,119 INFO L158 Benchmark]: Witness Printer took 700.26ms. Allocated memory is still 721.4MB. Free memory was 390.9MB in the beginning and 261.9MB in the end (delta: 129.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-20 10:31:40,121 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.34ms. Allocated memory is still 159.4MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3468.76ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 117.2MB in the beginning and 129.9MB in the end (delta: -12.7MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.45ms. Allocated memory is still 222.3MB. Free memory was 129.9MB in the beginning and 118.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.84ms. Allocated memory is still 222.3MB. Free memory was 118.4MB in the beginning and 112.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1698.22ms. Allocated memory was 222.3MB in the beginning and 283.1MB in the end (delta: 60.8MB). Free memory was 112.1MB in the beginning and 190.3MB in the end (delta: -78.2MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 57771.87ms. Allocated memory was 283.1MB in the beginning and 721.4MB in the end (delta: 438.3MB). Free memory was 189.2MB in the beginning and 390.9MB in the end (delta: -201.7MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. * Witness Printer took 700.26ms. Allocated memory is still 721.4MB. Free memory was 390.9MB in the beginning and 261.9MB in the end (delta: 129.0MB). Peak memory consumption was 130.0MB. 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 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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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_7,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.offset_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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_7,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.offset_7,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 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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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_7,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.offset_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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_7,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.offset_7,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 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] * 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: 57.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 977 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 933 mSDsluCounter, 3532 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 308 IncrementalHoareTripleChecker+Unchecked, 2850 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5684 IncrementalHoareTripleChecker+Invalid, 6300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 682 mSDtfsCounter, 5684 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 452 SyntacticMatches, 13 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, InterpolantAutomatonStates: 199, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 101 PreInvPairs, 125 NumberOfFragments, 1065 HoareAnnotationTreeSize, 101 FomulaSimplifications, 266 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 972 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 39.8s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1025 ConstructedInterpolants, 51 QuantifiedInterpolants, 4566 SizeOfPredicates, 34 NumberOfNonLiveVariables, 7351 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 324/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 [2022-11-20 10:31:40,139 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:40,140 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:40,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:40,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:40,140 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:40,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:40,141 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:40,141 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:40,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:40,141 WARN L421 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] [2022-11-20 10:31:40,142 WARN L421 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] [2022-11-20 10:31:40,142 WARN L421 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] [2022-11-20 10:31:40,143 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:40,143 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:40,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:40,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:40,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:40,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:31:40,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,QUANTIFIED] [2022-11-20 10:31:40,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7,QUANTIFIED] [2022-11-20 10:31:40,145 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2022-11-20 10:31:40,145 WARN L421 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] [2022-11-20 10:31:40,145 WARN L421 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] [2022-11-20 10:31:40,145 WARN L421 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] Derived loop invariant: (((((((((array == 0 && cur == 0) && length == unknown-#res!len-unknown) && 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) || (((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7 : int, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7 + 8] == 0) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset_7 + 8] == aws_byte_cursor_from_array_#res#1.ptr)) && !(cur == 0)) && !(array == 0)) && len == length) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] == unknown-#res!len-unknown && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] / 18446744073709551616 * 18446744073709551616)) RESULT: Ultimate proved your program to be correct! [2022-11-20 10:31:40,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67af9b3c-a563-4c4e-b246-9d0cbf5aa8a3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE