./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS --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 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- 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-4e7fbc6 [2022-11-23 03:57:40,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:57:40,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:57:40,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:57:40,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:57:40,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:57:40,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:57:40,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:57:40,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:57:40,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:57:40,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:57:40,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:57:40,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:57:40,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:57:40,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:57:40,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:57:40,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:57:40,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:57:40,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:57:40,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:57:40,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:57:40,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:57:40,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:57:40,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:57:40,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:57:40,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:57:40,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:57:40,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:57:40,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:57:40,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:57:40,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:57:40,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:57:40,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:57:40,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:57:40,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:57:40,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:57:40,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:57:40,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:57:40,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:57:40,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:57:40,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:57:40,806 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-23 03:57:40,829 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:57:40,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:57:40,830 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:57:40,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:57:40,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:57:40,831 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:57:40,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:57:40,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:57:40,833 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:57:40,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:57:40,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:57:40,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:57:40,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:57:40,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:57:40,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:57:40,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:57:40,836 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:57:40,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:57:40,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:57:40,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:57:40,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:57:40,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:57:40,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:57:40,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:57:40,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:57:40,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:57:40,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:57:40,840 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:57:40,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:57:40,840 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:57:40,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:57:40,841 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/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_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS 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 -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2022-11-23 03:57:41,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:57:41,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:57:41,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:57:41,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:57:41,212 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:57:41,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-23 03:57:44,316 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:57:45,017 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:57:45,018 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-23 03:57:45,077 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/data/726b5c447/105de8e9d31543b8987726d3df055916/FLAG59365d442 [2022-11-23 03:57:45,099 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/data/726b5c447/105de8e9d31543b8987726d3df055916 [2022-11-23 03:57:45,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:57:45,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:57:45,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:57:45,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:57:45,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:57:45,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:57:45" (1/1) ... [2022-11-23 03:57:45,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2867adb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:45, skipping insertion in model container [2022-11-23 03:57:45,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:57:45" (1/1) ... [2022-11-23 03:57:45,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:57:45,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:57:45,565 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_b805fb52-9bd3-46ea-90da-727efad46594/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-23 03:57:45,579 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_b805fb52-9bd3-46ea-90da-727efad46594/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-23 03:57:46,865 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,876 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,877 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,879 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,882 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,930 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,931 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,933 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:46,934 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:47,418 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 03:57:47,420 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 03:57:47,427 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 03:57:47,431 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 03:57:47,435 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 03:57:47,443 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 03:57:47,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 03:57:47,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 03:57:47,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 03:57:47,446 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 03:57:47,730 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 03:57:47,866 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:47,867 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:47,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:57:48,022 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:57:48,053 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_b805fb52-9bd3-46ea-90da-727efad46594/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-23 03:57:48,054 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_b805fb52-9bd3-46ea-90da-727efad46594/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-23 03:57:48,089 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,090 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,090 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,091 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,091 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,097 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,098 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,099 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,100 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,148 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 03:57:48,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 03:57:48,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 03:57:48,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 03:57:48,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 03:57:48,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 03:57:48,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 03:57:48,153 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 03:57:48,154 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 03:57:48,155 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 03:57:48,189 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 03:57:48,274 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,274 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:57:48,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:57:48,574 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:57:48,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48 WrapperNode [2022-11-23 03:57:48,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:57:48,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:57:48,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:57:48,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:57:48,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,802 INFO L138 Inliner]: procedures = 693, calls = 2791, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 873 [2022-11-23 03:57:48,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:57:48,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:57:48,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:57:48,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:57:48,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,876 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:57:48,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:57:48,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:57:48,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:57:48,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (1/1) ... [2022-11-23 03:57:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:57:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:57:48,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:57:48,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:57:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-23 03:57:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-23 03:57:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-23 03:57:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-23 03:57:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-11-23 03:57:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-11-23 03:57:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-23 03:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-23 03:57:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-23 03:57:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:57:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 03:57:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 03:57:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:57:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:57:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:57:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:57:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:57:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-23 03:57:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-23 03:57:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-23 03:57:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 03:57:49,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 03:57:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:57:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:57:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-11-23 03:57:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-11-23 03:57:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 03:57:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-23 03:57:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-23 03:57:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-23 03:57:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-23 03:57:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:57:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:57:49,388 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:57:49,390 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:57:50,991 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:57:51,004 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:57:51,005 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:57:51,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:57:51 BoogieIcfgContainer [2022-11-23 03:57:51,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:57:51,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:57:51,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:57:51,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:57:51,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:57:45" (1/3) ... [2022-11-23 03:57:51,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4f7ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:57:51, skipping insertion in model container [2022-11-23 03:57:51,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:57:48" (2/3) ... [2022-11-23 03:57:51,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4f7ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:57:51, skipping insertion in model container [2022-11-23 03:57:51,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:57:51" (3/3) ... [2022-11-23 03:57:51,027 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2022-11-23 03:57:51,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:57:51,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:57:51,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:57:51,139 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;@40ba4a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:57:51,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:57:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-23 03:57:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 03:57:51,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:57:51,167 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 03:57:51,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:57:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 39505431, now seen corresponding path program 1 times [2022-11-23 03:57:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:51,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476502262] [2022-11-23 03:57:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:57:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:51,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:57:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:57:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:57:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:57:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:57:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-23 03:57:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:57:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:57:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-23 03:57:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-23 03:57:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:52,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476502262] [2022-11-23 03:57:52,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476502262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:52,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:52,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:57:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447373358] [2022-11-23 03:57:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:57:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:52,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:57:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:57:52,167 INFO L87 Difference]: Start difference. First operand has 130 states, 87 states have (on average 1.264367816091954) internal successors, (110), 88 states have internal predecessors, (110), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 03:57:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:57:52,622 INFO L93 Difference]: Finished difference Result 251 states and 348 transitions. [2022-11-23 03:57:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:57:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-11-23 03:57:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:57:52,641 INFO L225 Difference]: With dead ends: 251 [2022-11-23 03:57:52,642 INFO L226 Difference]: Without dead ends: 125 [2022-11-23 03:57:52,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-23 03:57:52,664 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:57:52,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 162 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:57:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-23 03:57:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-23 03:57:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 84 states have internal predecessors, (104), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-23 03:57:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2022-11-23 03:57:52,752 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 71 [2022-11-23 03:57:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:57:52,754 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2022-11-23 03:57:52,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 03:57:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2022-11-23 03:57:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 03:57:52,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:57:52,766 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 03:57:52,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:57:52,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:57:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash 899154193, now seen corresponding path program 1 times [2022-11-23 03:57:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438230345] [2022-11-23 03:57:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:57:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:57:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:57:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:57:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:57:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:57:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-23 03:57:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:57:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:57:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-23 03:57:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-23 03:57:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:53,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438230345] [2022-11-23 03:57:53,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438230345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:53,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:53,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:57:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651187955] [2022-11-23 03:57:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:53,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:57:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:57:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:57:53,953 INFO L87 Difference]: Start difference. First operand 125 states and 165 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-23 03:57:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:57:54,513 INFO L93 Difference]: Finished difference Result 211 states and 280 transitions. [2022-11-23 03:57:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:57:54,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 71 [2022-11-23 03:57:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:57:54,520 INFO L225 Difference]: With dead ends: 211 [2022-11-23 03:57:54,520 INFO L226 Difference]: Without dead ends: 128 [2022-11-23 03:57:54,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-23 03:57:54,524 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 108 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:57:54,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 344 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:57:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-23 03:57:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-23 03:57:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 87 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-23 03:57:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2022-11-23 03:57:54,556 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 71 [2022-11-23 03:57:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:57:54,557 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2022-11-23 03:57:54,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-23 03:57:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2022-11-23 03:57:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-23 03:57:54,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:57:54,563 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 03:57:54,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:57:54,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:57:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1350542876, now seen corresponding path program 1 times [2022-11-23 03:57:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:54,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055783032] [2022-11-23 03:57:54,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:57:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:57:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:57:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:57:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:57:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:57:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:57:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:57:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:57:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 03:57:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-23 03:57:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:55,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055783032] [2022-11-23 03:57:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055783032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:55,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:55,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:57:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300627924] [2022-11-23 03:57:55,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:55,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:57:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:55,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:57:55,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:57:55,469 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 03:57:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:57:55,983 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-11-23 03:57:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:57:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 77 [2022-11-23 03:57:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:57:55,985 INFO L225 Difference]: With dead ends: 219 [2022-11-23 03:57:55,985 INFO L226 Difference]: Without dead ends: 163 [2022-11-23 03:57:55,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:57:55,987 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:57:55,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:57:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-23 03:57:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-11-23 03:57:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 108 states have internal predecessors, (132), 43 states have call successors, (43), 10 states have call predecessors, (43), 11 states have return successors, (44), 42 states have call predecessors, (44), 42 states have call successors, (44) [2022-11-23 03:57:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 219 transitions. [2022-11-23 03:57:56,005 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 219 transitions. Word has length 77 [2022-11-23 03:57:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:57:56,006 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 219 transitions. [2022-11-23 03:57:56,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 03:57:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 219 transitions. [2022-11-23 03:57:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-23 03:57:56,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:57:56,008 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-11-23 03:57:56,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:57:56,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:57:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 32555997, now seen corresponding path program 1 times [2022-11-23 03:57:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:56,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15274177] [2022-11-23 03:57:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:57:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:57:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:57:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:57:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:57:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:57:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:57:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:57:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:57:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 03:57:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:57:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-23 03:57:57,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:57,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15274177] [2022-11-23 03:57:57,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15274177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:57,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:57,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 03:57:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584057395] [2022-11-23 03:57:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:57,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:57:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:57:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:57:57,370 INFO L87 Difference]: Start difference. First operand 161 states and 219 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:57:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:57:58,060 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2022-11-23 03:57:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:57:58,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2022-11-23 03:57:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:57:58,062 INFO L225 Difference]: With dead ends: 172 [2022-11-23 03:57:58,063 INFO L226 Difference]: Without dead ends: 165 [2022-11-23 03:57:58,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 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-23 03:57:58,064 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:57:58,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 648 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:57:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-23 03:57:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-23 03:57:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 109 states have (on average 1.238532110091743) internal successors, (135), 112 states have internal predecessors, (135), 43 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (48), 42 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-23 03:57:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 226 transitions. [2022-11-23 03:57:58,081 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 226 transitions. Word has length 89 [2022-11-23 03:57:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:57:58,082 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 226 transitions. [2022-11-23 03:57:58,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:57:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 226 transitions. [2022-11-23 03:57:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-23 03:57:58,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:57:58,084 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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-23 03:57:58,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:57:58,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:57:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 581239205, now seen corresponding path program 1 times [2022-11-23 03:57:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:58,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020708895] [2022-11-23 03:57:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:57:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:57:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:58,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:57:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:57:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:58,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:57:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:57:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:57:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:57:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:57:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:57:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 03:57:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:57:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:57:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-23 03:57:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:57:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020708895] [2022-11-23 03:57:59,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020708895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:57:59,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:57:59,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:57:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410920349] [2022-11-23 03:57:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:57:59,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:57:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:57:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:57:59,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:57:59,273 INFO L87 Difference]: Start difference. First operand 165 states and 226 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:57:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:57:59,862 INFO L93 Difference]: Finished difference Result 300 states and 420 transitions. [2022-11-23 03:57:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:57:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2022-11-23 03:57:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:57:59,865 INFO L225 Difference]: With dead ends: 300 [2022-11-23 03:57:59,865 INFO L226 Difference]: Without dead ends: 190 [2022-11-23 03:57:59,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:57:59,867 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 137 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:57:59,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:57:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-23 03:57:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2022-11-23 03:57:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 117 states have internal predecessors, (142), 43 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (48), 42 states have call predecessors, (48), 42 states have call successors, (48) [2022-11-23 03:57:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2022-11-23 03:57:59,883 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 93 [2022-11-23 03:57:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:57:59,883 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2022-11-23 03:57:59,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:57:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2022-11-23 03:57:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-23 03:57:59,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:57:59,885 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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-23 03:57:59,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:57:59,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:57:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:57:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 839404643, now seen corresponding path program 1 times [2022-11-23 03:57:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:57:59,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616213009] [2022-11-23 03:57:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:57:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:58:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:58:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:58:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 03:58:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:58:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-23 03:58:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616213009] [2022-11-23 03:58:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616213009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135891543] [2022-11-23 03:58:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:02,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:02,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:58:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:03,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 2597 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 03:58:03,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:03,512 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 13 treesize of output 9 [2022-11-23 03:58:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-23 03:58:03,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:58:03,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135891543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:03,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:58:03,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2022-11-23 03:58:03,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677300870] [2022-11-23 03:58:03,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:03,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:58:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:03,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:58:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-23 03:58:03,966 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-23 03:58:06,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:09,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:11,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:13,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:13,931 INFO L93 Difference]: Finished difference Result 300 states and 402 transitions. [2022-11-23 03:58:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:58:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-11-23 03:58:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:13,934 INFO L225 Difference]: With dead ends: 300 [2022-11-23 03:58:13,934 INFO L226 Difference]: Without dead ends: 185 [2022-11-23 03:58:13,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-11-23 03:58:13,936 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 240 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 57 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:13,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 824 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 405 Invalid, 4 Unknown, 0 Unchecked, 9.8s Time] [2022-11-23 03:58:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-23 03:58:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-11-23 03:58:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 124 states have internal predecessors, (150), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (45), 43 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-23 03:58:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2022-11-23 03:58:13,985 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 93 [2022-11-23 03:58:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:13,986 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2022-11-23 03:58:13,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-23 03:58:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2022-11-23 03:58:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-23 03:58:13,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:13,988 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:14,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 03:58:14,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:14,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 302071913, now seen corresponding path program 1 times [2022-11-23 03:58:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:14,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911593562] [2022-11-23 03:58:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-23 03:58:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-23 03:58:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-23 03:58:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-23 03:58:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-23 03:58:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-23 03:58:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911593562] [2022-11-23 03:58:15,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911593562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400935880] [2022-11-23 03:58:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:15,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:15,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:15,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:58:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:16,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 03:58:16,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:58:16,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:58:16,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400935880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:16,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:58:16,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-11-23 03:58:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839572832] [2022-11-23 03:58:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:16,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:58:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:16,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:58:16,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:58:16,352 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-23 03:58:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:16,598 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2022-11-23 03:58:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:58:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2022-11-23 03:58:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:16,605 INFO L225 Difference]: With dead ends: 302 [2022-11-23 03:58:16,605 INFO L226 Difference]: Without dead ends: 190 [2022-11-23 03:58:16,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:58:16,607 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 13 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:16,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1172 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:58:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-23 03:58:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-11-23 03:58:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 129 states have internal predecessors, (154), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-23 03:58:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2022-11-23 03:58:16,660 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 246 transitions. Word has length 97 [2022-11-23 03:58:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:16,662 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 246 transitions. [2022-11-23 03:58:16,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-23 03:58:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2022-11-23 03:58:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 03:58:16,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:16,665 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:16,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:58:16,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:16,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1510879250, now seen corresponding path program 1 times [2022-11-23 03:58:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710109400] [2022-11-23 03:58:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:58:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:58:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:58:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:58:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:58:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-23 03:58:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710109400] [2022-11-23 03:58:17,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710109400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348823561] [2022-11-23 03:58:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:17,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:17,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:17,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:58:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 2609 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:58:18,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 03:58:18,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:58:18,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348823561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:18,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:58:18,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-23 03:58:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169577315] [2022-11-23 03:58:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:18,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:58:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:18,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:58:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:58:18,033 INFO L87 Difference]: Start difference. First operand 187 states and 246 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-23 03:58:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:18,079 INFO L93 Difference]: Finished difference Result 309 states and 417 transitions. [2022-11-23 03:58:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:58:18,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-23 03:58:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:18,082 INFO L225 Difference]: With dead ends: 309 [2022-11-23 03:58:18,083 INFO L226 Difference]: Without dead ends: 192 [2022-11-23 03:58:18,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:58:18,087 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:18,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 483 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:58:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-23 03:58:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-11-23 03:58:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 128 states have (on average 1.21875) internal successors, (156), 131 states have internal predecessors, (156), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-23 03:58:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2022-11-23 03:58:18,121 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 99 [2022-11-23 03:58:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:18,122 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2022-11-23 03:58:18,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-23 03:58:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2022-11-23 03:58:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 03:58:18,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:18,128 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 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-23 03:58:18,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:58:18,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:18,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1932962354, now seen corresponding path program 1 times [2022-11-23 03:58:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:18,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575247429] [2022-11-23 03:58:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:58:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:58:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:58:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:58:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:58:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-23 03:58:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:18,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575247429] [2022-11-23 03:58:18,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575247429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:18,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894130978] [2022-11-23 03:58:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:18,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:18,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:58:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:19,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:58:19,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-23 03:58:19,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:58:19,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894130978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:19,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:58:19,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-23 03:58:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130571607] [2022-11-23 03:58:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:19,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:58:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:58:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:58:19,459 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-23 03:58:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:19,503 INFO L93 Difference]: Finished difference Result 325 states and 438 transitions. [2022-11-23 03:58:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:58:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2022-11-23 03:58:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:19,505 INFO L225 Difference]: With dead ends: 325 [2022-11-23 03:58:19,506 INFO L226 Difference]: Without dead ends: 206 [2022-11-23 03:58:19,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:58:19,507 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:19,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 498 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:58:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-23 03:58:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2022-11-23 03:58:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 128 states have (on average 1.2109375) internal successors, (155), 131 states have internal predecessors, (155), 44 states have call successors, (44), 14 states have call predecessors, (44), 16 states have return successors, (48), 43 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-23 03:58:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2022-11-23 03:58:19,525 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 99 [2022-11-23 03:58:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:19,525 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2022-11-23 03:58:19,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-23 03:58:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2022-11-23 03:58:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 03:58:19,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:19,528 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:19,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:58:19,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 03:58:19,737 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:19,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash -400430284, now seen corresponding path program 1 times [2022-11-23 03:58:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:19,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192400240] [2022-11-23 03:58:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:21,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:58:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:58:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:58:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:58:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:58:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-23 03:58:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192400240] [2022-11-23 03:58:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192400240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364073418] [2022-11-23 03:58:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:22,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:22,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:58:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:23,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 03:58:23,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-23 03:58:24,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:58:25,104 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-23 03:58:25,105 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 24 treesize of output 19 [2022-11-23 03:58:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-23 03:58:25,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364073418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:58:25,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:58:25,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 25 [2022-11-23 03:58:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814243386] [2022-11-23 03:58:25,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:58:25,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 03:58:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 03:58:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-11-23 03:58:25,140 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-23 03:58:27,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:30,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:32,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:35,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:37,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:58:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:39,358 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2022-11-23 03:58:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 03:58:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 99 [2022-11-23 03:58:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:39,361 INFO L225 Difference]: With dead ends: 277 [2022-11-23 03:58:39,361 INFO L226 Difference]: Without dead ends: 223 [2022-11-23 03:58:39,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 03:58:39,363 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 435 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 119 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:39,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 856 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2034 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2022-11-23 03:58:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-23 03:58:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2022-11-23 03:58:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.1917808219178083) internal successors, (174), 147 states have internal predecessors, (174), 44 states have call successors, (44), 16 states have call predecessors, (44), 16 states have return successors, (45), 43 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-23 03:58:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2022-11-23 03:58:39,394 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 99 [2022-11-23 03:58:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:39,395 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2022-11-23 03:58:39,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 24 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-23 03:58:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2022-11-23 03:58:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 03:58:39,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:39,397 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:39,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:58:39,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 03:58:39,607 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:39,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash 768159994, now seen corresponding path program 1 times [2022-11-23 03:58:39,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:39,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672641006] [2022-11-23 03:58:39,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:58:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:58:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:58:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:58:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:58:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-23 03:58:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672641006] [2022-11-23 03:58:42,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672641006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:42,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175478880] [2022-11-23 03:58:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:42,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:42,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:42,690 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:42,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:58:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:43,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 2603 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-23 03:58:43,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-23 03:58:44,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:58:45,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:58:45,997 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 40 treesize of output 1 [2022-11-23 03:58:46,197 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-23 03:58:46,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2022-11-23 03:58:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-23 03:58:46,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175478880] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:58:46,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:58:46,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 30 [2022-11-23 03:58:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310425385] [2022-11-23 03:58:46,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:58:46,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-23 03:58:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-23 03:58:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-11-23 03:58:46,389 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-23 03:58:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:55,369 INFO L93 Difference]: Finished difference Result 398 states and 508 transitions. [2022-11-23 03:58:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-23 03:58:55,371 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 99 [2022-11-23 03:58:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:55,374 INFO L225 Difference]: With dead ends: 398 [2022-11-23 03:58:55,374 INFO L226 Difference]: Without dead ends: 379 [2022-11-23 03:58:55,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=943, Invalid=3479, Unknown=0, NotChecked=0, Total=4422 [2022-11-23 03:58:55,382 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 471 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:55,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1035 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-23 03:58:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-23 03:58:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 344. [2022-11-23 03:58:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 248 states have (on average 1.2056451612903225) internal successors, (299), 250 states have internal predecessors, (299), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-23 03:58:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 444 transitions. [2022-11-23 03:58:55,435 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 444 transitions. Word has length 99 [2022-11-23 03:58:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:55,436 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 444 transitions. [2022-11-23 03:58:55,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-23 03:58:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 444 transitions. [2022-11-23 03:58:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 03:58:55,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:55,440 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:58:55,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 03:58:55,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:55,650 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2140021892, now seen corresponding path program 1 times [2022-11-23 03:58:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540228024] [2022-11-23 03:58:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:58:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:58:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:58:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:58:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:58:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:58:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:58:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-23 03:58:59,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540228024] [2022-11-23 03:58:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540228024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488908074] [2022-11-23 03:58:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:59,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:59,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:59,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:59,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:59:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:00,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 03:59:00,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-23 03:59:02,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:03,309 INFO L321 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-11-23 03:59:03,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 49 [2022-11-23 03:59:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-23 03:59:03,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488908074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:59:03,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:59:03,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 30 [2022-11-23 03:59:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461971276] [2022-11-23 03:59:03,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:03,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-23 03:59:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-23 03:59:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2022-11-23 03:59:03,638 INFO L87 Difference]: Start difference. First operand 344 states and 444 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-23 03:59:06,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:08,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:10,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:16,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:18,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:20,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 03:59:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:21,441 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2022-11-23 03:59:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:59:21,442 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 99 [2022-11-23 03:59:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:21,445 INFO L225 Difference]: With dead ends: 396 [2022-11-23 03:59:21,445 INFO L226 Difference]: Without dead ends: 380 [2022-11-23 03:59:21,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 193 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=475, Invalid=1877, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 03:59:21,447 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 365 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 115 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:21,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 789 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2159 Invalid, 6 Unknown, 0 Unchecked, 16.0s Time] [2022-11-23 03:59:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-23 03:59:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 351. [2022-11-23 03:59:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 255 states have (on average 1.203921568627451) internal successors, (307), 257 states have internal predecessors, (307), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-23 03:59:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 452 transitions. [2022-11-23 03:59:21,518 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 452 transitions. Word has length 99 [2022-11-23 03:59:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:21,519 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 452 transitions. [2022-11-23 03:59:21,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 29 states have internal predecessors, (128), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-23 03:59:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 452 transitions. [2022-11-23 03:59:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-23 03:59:21,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:21,522 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:21,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:21,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 03:59:21,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1881856454, now seen corresponding path program 1 times [2022-11-23 03:59:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:21,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079641745] [2022-11-23 03:59:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:21,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:59:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:59:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:59:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:59:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:59:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:59:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:59:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:59:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-23 03:59:22,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079641745] [2022-11-23 03:59:22,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079641745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:22,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:22,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:59:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561525748] [2022-11-23 03:59:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:22,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:59:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:59:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:59:22,705 INFO L87 Difference]: Start difference. First operand 351 states and 452 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:59:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:23,387 INFO L93 Difference]: Finished difference Result 535 states and 680 transitions. [2022-11-23 03:59:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:59:23,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2022-11-23 03:59:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:23,391 INFO L225 Difference]: With dead ends: 535 [2022-11-23 03:59:23,391 INFO L226 Difference]: Without dead ends: 359 [2022-11-23 03:59:23,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:59:23,394 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:23,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 389 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:59:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-23 03:59:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 349. [2022-11-23 03:59:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 253 states have (on average 1.1936758893280632) internal successors, (302), 255 states have internal predecessors, (302), 69 states have call successors, (69), 24 states have call predecessors, (69), 26 states have return successors, (76), 69 states have call predecessors, (76), 67 states have call successors, (76) [2022-11-23 03:59:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2022-11-23 03:59:23,459 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 99 [2022-11-23 03:59:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:23,465 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2022-11-23 03:59:23,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:59:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2022-11-23 03:59:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 03:59:23,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:23,468 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:23,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:59:23,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash 964318207, now seen corresponding path program 1 times [2022-11-23 03:59:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143486768] [2022-11-23 03:59:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:59:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:59:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:59:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:59:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:59:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:59:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:59:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:59:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-23 03:59:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:24,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143486768] [2022-11-23 03:59:24,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143486768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:24,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:24,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 03:59:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638600235] [2022-11-23 03:59:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:24,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:59:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:59:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:59:24,667 INFO L87 Difference]: Start difference. First operand 349 states and 447 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:59:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:25,584 INFO L93 Difference]: Finished difference Result 363 states and 462 transitions. [2022-11-23 03:59:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:59:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2022-11-23 03:59:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:25,587 INFO L225 Difference]: With dead ends: 363 [2022-11-23 03:59:25,587 INFO L226 Difference]: Without dead ends: 323 [2022-11-23 03:59:25,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-23 03:59:25,588 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:25,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 814 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 03:59:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-23 03:59:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 304. [2022-11-23 03:59:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.2009132420091324) internal successors, (263), 221 states have internal predecessors, (263), 60 states have call successors, (60), 23 states have call predecessors, (60), 24 states have return successors, (61), 59 states have call predecessors, (61), 58 states have call successors, (61) [2022-11-23 03:59:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 384 transitions. [2022-11-23 03:59:25,643 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 384 transitions. Word has length 101 [2022-11-23 03:59:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:25,643 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 384 transitions. [2022-11-23 03:59:25,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-23 03:59:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 384 transitions. [2022-11-23 03:59:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 03:59:25,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:25,647 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:25,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:59:25,648 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1368667261, now seen corresponding path program 1 times [2022-11-23 03:59:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:25,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032669429] [2022-11-23 03:59:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-23 03:59:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:59:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:59:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:59:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-23 03:59:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-23 03:59:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-23 03:59:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 03:59:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 03:59:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-23 03:59:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:28,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032669429] [2022-11-23 03:59:28,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032669429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:28,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:28,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-23 03:59:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896855116] [2022-11-23 03:59:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:28,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 03:59:28,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:28,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 03:59:28,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:59:28,631 INFO L87 Difference]: Start difference. First operand 304 states and 384 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-23 03:59:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:30,166 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2022-11-23 03:59:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 03:59:30,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2022-11-23 03:59:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:30,169 INFO L225 Difference]: With dead ends: 324 [2022-11-23 03:59:30,169 INFO L226 Difference]: Without dead ends: 272 [2022-11-23 03:59:30,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-11-23 03:59:30,170 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 195 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:30,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 858 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 03:59:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-23 03:59:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2022-11-23 03:59:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.2032967032967032) internal successors, (219), 184 states have internal predecessors, (219), 46 states have call successors, (46), 22 states have call predecessors, (46), 23 states have return successors, (45), 45 states have call predecessors, (45), 44 states have call successors, (45) [2022-11-23 03:59:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 310 transitions. [2022-11-23 03:59:30,211 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 310 transitions. Word has length 101 [2022-11-23 03:59:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:30,211 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 310 transitions. [2022-11-23 03:59:30,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 13 states have internal predecessors, (62), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-23 03:59:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 310 transitions. [2022-11-23 03:59:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-23 03:59:30,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:30,214 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 03:59:30,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 03:59:30,214 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -171267616, now seen corresponding path program 1 times [2022-11-23 03:59:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:30,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789900163] [2022-11-23 03:59:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:30,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 03:59:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 03:59:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 03:59:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:59:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-23 03:59:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-23 03:59:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-23 03:59:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-23 03:59:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-23 03:59:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-23 03:59:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-23 03:59:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-23 03:59:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789900163] [2022-11-23 03:59:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789900163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794371257] [2022-11-23 03:59:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:31,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:31,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:31,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:59:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:32,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 2715 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 03:59:32,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-23 03:59:32,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-23 03:59:32,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794371257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:59:32,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:59:32,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2022-11-23 03:59:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570868556] [2022-11-23 03:59:32,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:32,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 03:59:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 03:59:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-23 03:59:32,811 INFO L87 Difference]: Start difference. First operand 252 states and 310 transitions. Second operand has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-23 03:59:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:33,609 INFO L93 Difference]: Finished difference Result 262 states and 317 transitions. [2022-11-23 03:59:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:59:33,610 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) Word has length 117 [2022-11-23 03:59:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:33,610 INFO L225 Difference]: With dead ends: 262 [2022-11-23 03:59:33,610 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 03:59:33,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 03:59:33,612 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:33,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 250 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:59:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 03:59:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 03:59:33,613 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-23 03:59:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 03:59:33,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2022-11-23 03:59:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:33,614 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 03:59:33,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-23 03:59:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 03:59:33,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 03:59:33,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 03:59:33,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:33,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 03:59:33,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 03:59:52,528 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1))))) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-11-23 03:59:52,528 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-11-23 03:59:52,535 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-23 03:59:52,535 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-11-23 03:59:52,539 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse1 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (let ((.cse0 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (and (<= (+ .cse0 1) |ensure_string_is_allocated_bounded_length_~len~1#1|) (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ .cse0 15)))) .cse1) (or .cse1 (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-23 03:59:52,539 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-11-23 03:59:52,541 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse2 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse2) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse3 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse3) 18446744073709551616)) .cse3)))))) [2022-11-23 03:59:52,541 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-11-23 03:59:52,542 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-23 03:59:52,542 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-23 03:59:52,542 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-11-23 03:59:52,543 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-11-23 03:59:52,543 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616))))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse1) 18446744073709551616)) .cse1)))))) [2022-11-23 03:59:52,543 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-11-23 03:59:52,543 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-11-23 03:59:52,543 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-23 03:59:52,544 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-23 03:59:52,544 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-23 03:59:52,544 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-23 03:59:52,544 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (or (= |bounded_malloc_#in~size| bounded_malloc_~size) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))))) (= |old(#valid)| |#valid|)) [2022-11-23 03:59:52,544 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-11-23 03:59:52,546 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-11-23 03:59:52,546 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-11-23 03:59:52,547 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-23 03:59:52,548 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-23 03:59:52,549 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-11-23 03:59:52,549 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-11-23 03:59:52,549 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-11-23 03:59:52,549 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-11-23 03:59:52,550 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-11-23 03:59:52,550 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-11-23 03:59:52,550 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-11-23 03:59:52,550 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-11-23 03:59:52,550 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-23 03:59:52,551 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-23 03:59:52,552 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-23 03:59:52,553 INFO L895 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,553 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-23 03:59:52,553 INFO L899 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2022-11-23 03:59:52,553 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-11-23 03:59:52,554 INFO L895 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,554 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-11-23 03:59:52,554 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-23 03:59:52,554 INFO L899 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2022-11-23 03:59:52,554 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-11-23 03:59:52,555 INFO L895 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,555 INFO L895 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2022-11-23 03:59:52,555 INFO L895 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2022-11-23 03:59:52,555 INFO L899 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2022-11-23 03:59:52,555 INFO L899 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2022-11-23 03:59:52,556 INFO L895 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,556 INFO L899 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2022-11-23 03:59:52,556 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-23 03:59:52,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 03:59:52,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-23 03:59:52,556 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-23 03:59:52,557 INFO L902 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2022-11-23 03:59:52,557 INFO L899 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2022-11-23 03:59:52,557 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-11-23 03:59:52,557 INFO L895 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,557 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-11-23 03:59:52,557 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-23 03:59:52,557 INFO L899 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2022-11-23 03:59:52,557 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-11-23 03:59:52,557 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2022-11-23 03:59:52,558 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0))) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|))) (or (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1341#1| 0) (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1341#1|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|) .cse0 .cse1 .cse2) (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse5 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616)))) (let ((.cse4 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse4 (+ .cse3 (* 18446744073709551616 (div (+ (- .cse3) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616))))) .cse0 .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) .cse2 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-23 03:59:52,558 INFO L895 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,558 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-11-23 03:59:52,558 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-11-23 03:59:52,558 INFO L899 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2022-11-23 03:59:52,559 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-23 03:59:52,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 03:59:52,559 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-23 03:59:52,559 INFO L895 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2022-11-23 03:59:52,559 INFO L899 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2022-11-23 03:59:52,559 INFO L899 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2022-11-23 03:59:52,560 INFO L895 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) [2022-11-23 03:59:52,560 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-11-23 03:59:52,560 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-23 03:59:52,560 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-11-23 03:59:52,560 INFO L895 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) [2022-11-23 03:59:52,560 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-11-23 03:59:52,560 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-23 03:59:52,560 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-11-23 03:59:52,560 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1349#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1349#1| 1)) [2022-11-23 03:59:52,561 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-11-23 03:59:52,561 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-11-23 03:59:52,561 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-23 03:59:52,561 INFO L899 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2022-11-23 03:59:52,561 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,561 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-11-23 03:59:52,562 INFO L899 garLoopResultBuilder]: For program point L9548-2(lines 9548 9554) no Hoare annotation was computed. [2022-11-23 03:59:52,562 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-23 03:59:52,562 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (<= 0 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15|) 0))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3| 8)) 0))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4|) 16))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616)))))) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-23 03:59:52,562 INFO L895 garLoopResultBuilder]: At program point L9548-4(lines 9548 9554) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse0 (select .cse2 16))) (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) (let ((.cse1 (select .cse2 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (<= .cse1 (+ .cse0 (* 18446744073709551616 (div (+ (- .cse0) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse1 18446744073709551616))))) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))) [2022-11-23 03:59:52,562 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-11-23 03:59:52,562 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-23 03:59:52,563 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-23 03:59:52,563 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-23 03:59:52,563 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-23 03:59:52,563 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-23 03:59:52,563 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-23 03:59:52,567 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:52,569 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:59:52,578 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,578 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,579 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:52,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,579 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,586 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:52,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,589 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:52,590 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:52,591 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,592 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,594 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:52,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:52,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,594 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:52,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:52,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:59:52 BoogieIcfgContainer [2022-11-23 03:59:52,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:59:52,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:59:52,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:59:52,597 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:59:52,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:57:51" (3/4) ... [2022-11-23 03:59:52,601 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 03:59:52,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-11-23 03:59:52,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-23 03:59:52,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-11-23 03:59:52,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-23 03:59:52,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-23 03:59:52,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-23 03:59:52,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-23 03:59:52,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-23 03:59:52,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-23 03:59:52,610 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-11-23 03:59:52,624 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-11-23 03:59:52,625 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-11-23 03:59:52,626 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-23 03:59:52,628 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-23 03:59:52,629 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-23 03:59:52,630 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 03:59:52,631 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 03:59:52,632 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 03:59:52,665 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: !(\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: !(0 <= 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0]))) || ((((unknown-#in~max_size-unknown == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(unknown-#in~max_size-unknown == 16)) [2022-11-23 03:59:52,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((str == 0 && str == 0) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0])) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0))) && !(buf == 0)) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616))) && buf == 0 [2022-11-23 03:59:53,139 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:59:53,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:59:53,140 INFO L158 Benchmark]: Toolchain (without parser) took 128035.32ms. Allocated memory was 174.1MB in the beginning and 557.8MB in the end (delta: 383.8MB). Free memory was 119.7MB in the beginning and 230.2MB in the end (delta: -110.5MB). Peak memory consumption was 274.9MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,140 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory was 76.2MB in the beginning and 76.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:59:53,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3464.47ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 119.2MB in the beginning and 157.8MB in the end (delta: -38.6MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 230.37ms. Allocated memory is still 220.2MB. Free memory was 157.8MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,141 INFO L158 Benchmark]: Boogie Preprocessor took 82.93ms. Allocated memory is still 220.2MB. Free memory was 145.2MB in the beginning and 137.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,142 INFO L158 Benchmark]: RCFGBuilder took 2118.62ms. Allocated memory is still 220.2MB. Free memory was 137.9MB in the beginning and 138.4MB in the end (delta: -468.8kB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,142 INFO L158 Benchmark]: TraceAbstraction took 121583.65ms. Allocated memory was 220.2MB in the beginning and 557.8MB in the end (delta: 337.6MB). Free memory was 137.3MB in the beginning and 362.3MB in the end (delta: -225.0MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,142 INFO L158 Benchmark]: Witness Printer took 542.97ms. Allocated memory is still 557.8MB. Free memory was 362.3MB in the beginning and 230.2MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-11-23 03:59:53,144 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.30ms. Allocated memory is still 134.2MB. Free memory was 76.2MB in the beginning and 76.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3464.47ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 119.2MB in the beginning and 157.8MB in the end (delta: -38.6MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 230.37ms. Allocated memory is still 220.2MB. Free memory was 157.8MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.93ms. Allocated memory is still 220.2MB. Free memory was 145.2MB in the beginning and 137.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2118.62ms. Allocated memory is still 220.2MB. Free memory was 137.9MB in the beginning and 138.4MB in the end (delta: -468.8kB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * TraceAbstraction took 121583.65ms. Allocated memory was 220.2MB in the beginning and 557.8MB in the end (delta: 337.6MB). Free memory was 137.3MB in the beginning and 362.3MB in the end (delta: -225.0MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB. * Witness Printer took 542.97ms. Allocated memory is still 557.8MB. Free memory was 362.3MB in the beginning and 230.2MB in the end (delta: 132.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,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 11 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 121.5s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 58.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 2593 SdHoareTripleChecker+Valid, 49.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2455 mSDsluCounter, 9755 SdHoareTripleChecker+Invalid, 47.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7954 mSDsCounter, 750 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11632 IncrementalHoareTripleChecker+Invalid, 12397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 750 mSolverCounterUnsat, 1801 mSDtfsCounter, 11632 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1839 GetRequests, 1503 SyntacticMatches, 31 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=12, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 177 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 359 PreInvPairs, 395 NumberOfFragments, 1931 HoareAnnotationTreeSize, 359 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 5783 FormulaSimplificationTreeSizeReductionInter, 18.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 2306 NumberOfCodeBlocks, 2306 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2692 ConstructedInterpolants, 101 QuantifiedInterpolants, 15263 SizeOfPredicates, 74 NumberOfNonLiveVariables, 20953 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 1690/1864 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: 6598]: Loop Invariant [2022-11-23 03:59:53,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,168 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:53,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,169 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:53,170 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,171 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] Derived loop invariant: (((((str == 0 && str == 0) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0])) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0))) && !(buf == 0)) && (\exists v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616))) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2022-11-23 03:59:53,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:53,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-unknown-#memory_int-unknown[buf][16] + 18446744073709551615) / 18446744073709551616) + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][buf + 8] == 0)) && buf == 0) && buf == buf) && buf == 0 - InvariantResult [Line: 6806]: Loop Invariant [2022-11-23 03:59:53,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:53,173 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,173 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 03:59:53,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3,QUANTIFIED] [2022-11-23 03:59:53,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4,QUANTIFIED] [2022-11-23 03:59:53,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] [2022-11-23 03:59:53,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15,QUANTIFIED] Derived loop invariant: (((forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 : int, v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_3][v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset_BEFORE_CALL_3 + 8] == 0) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4 : int :: !(\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_4][16]) / 18446744073709551616)))) || (forall v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15 : int :: !(0 <= 18446744073709551616 * (-\old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0] / 18446744073709551616) + \old(unknown-#memory_int-unknown)[v_ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base_BEFORE_CALL_15][0]))) || ((((unknown-#in~max_size-unknown == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(unknown-#in~max_size-unknown == 16)) RESULT: Ultimate proved your program to be correct! [2022-11-23 03:59:53,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b805fb52-9bd3-46ea-90da-727efad46594/bin/uautomizer-QkZJyEgLgS/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