./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a --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 a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 --- 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-b5237d8 [2022-11-21 16:21:29,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:21:29,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:21:29,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:21:29,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:21:29,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:21:29,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:21:30,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:21:30,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:21:30,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:21:30,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:21:30,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:21:30,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:21:30,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:21:30,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:21:30,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:21:30,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:21:30,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:21:30,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:21:30,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:21:30,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:21:30,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:21:30,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:21:30,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:21:30,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:21:30,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:21:30,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:21:30,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:21:30,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:21:30,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:21:30,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:21:30,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:21:30,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:21:30,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:21:30,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:21:30,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:21:30,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:21:30,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:21:30,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:21:30,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:21:30,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:21:30,042 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:21:30,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:21:30,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:21:30,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:21:30,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:21:30,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:21:30,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:21:30,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:21:30,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:21:30,067 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:21:30,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:21:30,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:21:30,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:21:30,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:21:30,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:21:30,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:21:30,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:21:30,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:21:30,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:21:30,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:21:30,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:21:30,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:21:30,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:21:30,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:21:30,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:21:30,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:21:30,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:21:30,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:21:30,070 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:21:30,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:21:30,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:21:30,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/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_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a 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 -> a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 [2022-11-21 16:21:30,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:21:30,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:21:30,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:21:30,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:21:30,434 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:21:30,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-11-21 16:21:33,519 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:21:34,139 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:21:34,139 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-11-21 16:21:34,182 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/data/ea779c9d1/f23846031ac64a8da30cab340680f02a/FLAGaf2ef948c [2022-11-21 16:21:34,199 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/data/ea779c9d1/f23846031ac64a8da30cab340680f02a [2022-11-21 16:21:34,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:21:34,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:21:34,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:21:34,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:21:34,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:21:34,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:21:34" (1/1) ... [2022-11-21 16:21:34,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b00320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:34, skipping insertion in model container [2022-11-21 16:21:34,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:21:34" (1/1) ... [2022-11-21 16:21:34,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:21:34,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:21:34,626 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_7ea6d300-9a19-4600-b487-cf46fa528168/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2022-11-21 16:21:34,637 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_7ea6d300-9a19-4600-b487-cf46fa528168/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2022-11-21 16:21:35,913 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,914 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,914 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,915 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,917 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,941 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,943 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,945 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,946 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,948 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,950 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,950 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:35,951 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:36,649 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 16:21:36,651 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 16:21:36,652 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 16:21:36,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 16:21:36,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 16:21:36,656 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 16:21:36,656 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 16:21:36,657 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 16:21:36,658 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 16:21:36,659 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 16:21:36,917 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 16:21:37,338 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,340 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,434 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,436 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,447 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,449 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,526 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,531 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,532 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,533 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,534 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,534 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,535 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:21:37,650 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:21:37,680 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_7ea6d300-9a19-4600-b487-cf46fa528168/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2022-11-21 16:21:37,681 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_7ea6d300-9a19-4600-b487-cf46fa528168/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2022-11-21 16:21:37,747 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,747 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,748 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,748 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,749 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,762 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,764 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,765 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,766 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,767 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,768 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,768 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,769 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:37,808 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 16:21:37,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 16:21:37,811 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 16:21:37,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 16:21:37,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 16:21:37,815 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 16:21:37,816 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 16:21:37,816 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 16:21:37,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 16:21:37,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 16:21:37,854 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 16:21:38,013 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,014 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,024 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,024 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,028 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,029 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,045 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,046 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,047 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,048 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,048 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,049 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,050 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 16:21:38,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:21:38,389 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:21:38,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38 WrapperNode [2022-11-21 16:21:38,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:21:38,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:21:38,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:21:38,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:21:38,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,653 INFO L138 Inliner]: procedures = 775, calls = 2488, calls flagged for inlining = 67, calls inlined = 21, statements flattened = 1285 [2022-11-21 16:21:38,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:21:38,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:21:38,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:21:38,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:21:38,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,805 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:21:38,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:21:38,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:21:38,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:21:38,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (1/1) ... [2022-11-21 16:21:38,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:21:38,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:21:38,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:21:38,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:21:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-21 16:21:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-21 16:21:38,932 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-21 16:21:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:21:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-21 16:21:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-21 16:21:38,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 16:21:38,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 16:21:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2022-11-21 16:21:38,935 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2022-11-21 16:21:38,935 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-21 16:21:38,935 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-21 16:21:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:21:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:21:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:21:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-11-21 16:21:38,936 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-11-21 16:21:38,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:21:38,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:21:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-21 16:21:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-21 16:21:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-21 16:21:38,937 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-21 16:21:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-11-21 16:21:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-11-21 16:21:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:21:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-21 16:21:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-21 16:21:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:21:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-21 16:21:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-21 16:21:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:21:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-11-21 16:21:38,939 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-11-21 16:21:38,939 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-21 16:21:38,939 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-21 16:21:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-11-21 16:21:38,940 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-11-21 16:21:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-11-21 16:21:38,940 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-11-21 16:21:38,940 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-11-21 16:21:38,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-11-21 16:21:38,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:21:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-21 16:21:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-21 16:21:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-11-21 16:21:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-11-21 16:21:38,947 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-11-21 16:21:38,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-21 16:21:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-21 16:21:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-21 16:21:38,948 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-11-21 16:21:38,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-11-21 16:21:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-11-21 16:21:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-11-21 16:21:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-11-21 16:21:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-11-21 16:21:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:21:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:21:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-21 16:21:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-21 16:21:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:21:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-21 16:21:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-21 16:21:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-21 16:21:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-21 16:21:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-21 16:21:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-21 16:21:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-11-21 16:21:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-11-21 16:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-11-21 16:21:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-11-21 16:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-21 16:21:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-21 16:21:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:21:39,493 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:21:39,496 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:21:39,902 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-11-21 16:21:39,943 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-11-21 16:21:40,789 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-11-21 16:21:40,789 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-11-21 16:21:41,497 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:21:41,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:21:41,515 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-21 16:21:41,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:41 BoogieIcfgContainer [2022-11-21 16:21:41,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:21:41,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:21:41,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:21:41,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:21:41,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:21:34" (1/3) ... [2022-11-21 16:21:41,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173196d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:21:41, skipping insertion in model container [2022-11-21 16:21:41,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:21:38" (2/3) ... [2022-11-21 16:21:41,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173196d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:21:41, skipping insertion in model container [2022-11-21 16:21:41,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:41" (3/3) ... [2022-11-21 16:21:41,533 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2022-11-21 16:21:41,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:21:41,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:21:41,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:21:41,661 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;@4922dac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:21:41,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:21:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 233 states have (on average 1.2660944206008584) internal successors, (295), 230 states have internal predecessors, (295), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-21 16:21:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-21 16:21:41,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:21:41,683 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:41,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:21:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2042396882, now seen corresponding path program 1 times [2022-11-21 16:21:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378299997] [2022-11-21 16:21:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:42,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378299997] [2022-11-21 16:21:42,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-21 16:21:42,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308675290] [2022-11-21 16:21:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:42,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:21:42,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:21:42,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:21:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:43,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:21:43,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:21:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-21 16:21:43,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:21:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308675290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:21:43,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:21:43,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:21:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713164275] [2022-11-21 16:21:43,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:21:43,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:21:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:21:43,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:21:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:21:43,178 INFO L87 Difference]: Start difference. First operand has 347 states, 233 states have (on average 1.2660944206008584) internal successors, (295), 230 states have internal predecessors, (295), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 16:21:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:21:43,249 INFO L93 Difference]: Finished difference Result 688 states and 975 transitions. [2022-11-21 16:21:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:21:43,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2022-11-21 16:21:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:21:43,263 INFO L225 Difference]: With dead ends: 688 [2022-11-21 16:21:43,264 INFO L226 Difference]: Without dead ends: 339 [2022-11-21 16:21:43,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:21:43,274 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:21:43,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:21:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-21 16:21:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-11-21 16:21:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 222 states have (on average 1.2477477477477477) internal successors, (277), 224 states have internal predecessors, (277), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-21 16:21:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 447 transitions. [2022-11-21 16:21:43,346 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 447 transitions. Word has length 122 [2022-11-21 16:21:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:21:43,348 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 447 transitions. [2022-11-21 16:21:43,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 16:21:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 447 transitions. [2022-11-21 16:21:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-21 16:21:43,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:21:43,351 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:43,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:21:43,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:43,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:21:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1202487832, now seen corresponding path program 1 times [2022-11-21 16:21:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:43,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136148409] [2022-11-21 16:21:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:43,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 16:21:43,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224977564] [2022-11-21 16:21:43,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:43,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:21:43,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:21:43,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:21:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:44,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:21:44,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:21:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-21 16:21:44,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:21:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:44,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136148409] [2022-11-21 16:21:44,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 16:21:44,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224977564] [2022-11-21 16:21:44,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224977564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:21:44,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:21:44,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:21:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396204289] [2022-11-21 16:21:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:21:44,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:21:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:21:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:21:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:21:44,678 INFO L87 Difference]: Start difference. First operand 339 states and 447 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 16:21:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:21:44,795 INFO L93 Difference]: Finished difference Result 674 states and 893 transitions. [2022-11-21 16:21:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:21:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2022-11-21 16:21:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:21:44,802 INFO L225 Difference]: With dead ends: 674 [2022-11-21 16:21:44,802 INFO L226 Difference]: Without dead ends: 344 [2022-11-21 16:21:44,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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-21 16:21:44,806 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 2 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:21:44,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1768 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:21:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-21 16:21:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-11-21 16:21:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 226 states have (on average 1.2433628318584071) internal successors, (281), 228 states have internal predecessors, (281), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2022-11-21 16:21:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 455 transitions. [2022-11-21 16:21:44,836 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 455 transitions. Word has length 122 [2022-11-21 16:21:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:21:44,837 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 455 transitions. [2022-11-21 16:21:44,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 16:21:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 455 transitions. [2022-11-21 16:21:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-21 16:21:44,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:21:44,840 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:44,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:21:45,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:45,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:21:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1407527950, now seen corresponding path program 1 times [2022-11-21 16:21:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:45,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248070552] [2022-11-21 16:21:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:21:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:21:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:21:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:45,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:21:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:21:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:21:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:21:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:21:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:21:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:21:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:21:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:21:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:21:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:21:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 16:21:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:21:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 16:21:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-21 16:21:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:46,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248070552] [2022-11-21 16:21:46,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248070552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:21:46,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:21:46,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:21:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751097258] [2022-11-21 16:21:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:21:46,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:21:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:21:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:21:46,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:21:46,453 INFO L87 Difference]: Start difference. First operand 344 states and 455 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-21 16:21:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:21:48,884 INFO L93 Difference]: Finished difference Result 754 states and 1012 transitions. [2022-11-21 16:21:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:21:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 128 [2022-11-21 16:21:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:21:48,896 INFO L225 Difference]: With dead ends: 754 [2022-11-21 16:21:48,897 INFO L226 Difference]: Without dead ends: 424 [2022-11-21 16:21:48,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:21:48,899 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 441 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:21:48,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 874 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-21 16:21:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-11-21 16:21:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 344. [2022-11-21 16:21:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 226 states have (on average 1.238938053097345) internal successors, (280), 228 states have internal predecessors, (280), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2022-11-21 16:21:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 454 transitions. [2022-11-21 16:21:48,940 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 454 transitions. Word has length 128 [2022-11-21 16:21:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:21:48,941 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 454 transitions. [2022-11-21 16:21:48,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-21 16:21:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 454 transitions. [2022-11-21 16:21:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-21 16:21:48,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:21:48,944 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:21:48,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:21:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1824924556, now seen corresponding path program 1 times [2022-11-21 16:21:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:48,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597607104] [2022-11-21 16:21:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:21:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:21:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:21:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:21:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:21:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:21:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:21:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:21:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:21:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 16:21:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:21:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:21:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:21:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:21:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 16:21:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:21:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 16:21:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-21 16:21:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:50,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597607104] [2022-11-21 16:21:50,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597607104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:21:50,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:21:50,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-21 16:21:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096177169] [2022-11-21 16:21:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:21:50,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 16:21:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:21:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 16:21:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:21:50,965 INFO L87 Difference]: Start difference. First operand 344 states and 454 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-21 16:21:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:21:56,954 INFO L93 Difference]: Finished difference Result 750 states and 1004 transitions. [2022-11-21 16:21:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:21:56,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 128 [2022-11-21 16:21:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:21:56,959 INFO L225 Difference]: With dead ends: 750 [2022-11-21 16:21:56,959 INFO L226 Difference]: Without dead ends: 427 [2022-11-21 16:21:56,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:21:56,962 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 447 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:21:56,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1865 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-21 16:21:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-21 16:21:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 347. [2022-11-21 16:21:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 228 states have (on average 1.236842105263158) internal successors, (282), 231 states have internal predecessors, (282), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2022-11-21 16:21:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 457 transitions. [2022-11-21 16:21:57,005 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 457 transitions. Word has length 128 [2022-11-21 16:21:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:21:57,006 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 457 transitions. [2022-11-21 16:21:57,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-21 16:21:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 457 transitions. [2022-11-21 16:21:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-21 16:21:57,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:21:57,009 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:57,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:21:57,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:21:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -510465640, now seen corresponding path program 1 times [2022-11-21 16:21:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360715278] [2022-11-21 16:21:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:21:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:21:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:21:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:21:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:21:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:21:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:21:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:21:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:21:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:21:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:21:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:21:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:21:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:21:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-21 16:21:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:21:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 16:21:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 16:21:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:21:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-21 16:21:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:58,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360715278] [2022-11-21 16:21:58,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360715278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:21:58,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553645115] [2022-11-21 16:21:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:58,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:58,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:21:58,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:21:58,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:21:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:59,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 16:21:59,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:22:01,753 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-11-21 16:22:09,858 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:17,976 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-21 16:22:18,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:22:18,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553645115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:18,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:22:18,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-11-21 16:22:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846862366] [2022-11-21 16:22:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:18,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:22:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:22:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-11-21 16:22:18,015 INFO L87 Difference]: Start difference. First operand 347 states and 457 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-21 16:22:19,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:22:25,872 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:28,178 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-21 16:22:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:22:30,942 INFO L93 Difference]: Finished difference Result 681 states and 896 transitions. [2022-11-21 16:22:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:22:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2022-11-21 16:22:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:22:30,949 INFO L225 Difference]: With dead ends: 681 [2022-11-21 16:22:30,949 INFO L226 Difference]: Without dead ends: 353 [2022-11-21 16:22:30,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=64, Invalid=279, Unknown=3, NotChecked=34, Total=380 [2022-11-21 16:22:30,951 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 12 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:22:30,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2374 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 1 Unknown, 457 Unchecked, 6.6s Time] [2022-11-21 16:22:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-21 16:22:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-11-21 16:22:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 232 states have (on average 1.2327586206896552) internal successors, (286), 235 states have internal predecessors, (286), 87 states have call successors, (87), 31 states have call predecessors, (87), 33 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-11-21 16:22:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2022-11-21 16:22:30,981 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 134 [2022-11-21 16:22:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:22:30,982 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2022-11-21 16:22:30,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-21 16:22:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2022-11-21 16:22:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-21 16:22:30,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:22:30,985 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:22:31,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 16:22:31,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:22:31,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:22:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 928186415, now seen corresponding path program 1 times [2022-11-21 16:22:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:31,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160393363] [2022-11-21 16:22:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:22:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:22:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:22:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:22:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:22:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:22:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:22:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:22:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:22:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:22:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:22:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:22:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:22:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:22:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:22:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:22:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-21 16:22:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-21 16:22:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:32,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160393363] [2022-11-21 16:22:32,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160393363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:32,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:32,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:22:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445403480] [2022-11-21 16:22:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:32,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:22:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:22:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:22:32,362 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-21 16:22:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:22:35,971 INFO L93 Difference]: Finished difference Result 745 states and 997 transitions. [2022-11-21 16:22:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:22:35,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2022-11-21 16:22:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:22:35,976 INFO L225 Difference]: With dead ends: 745 [2022-11-21 16:22:35,976 INFO L226 Difference]: Without dead ends: 435 [2022-11-21 16:22:35,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:22:35,979 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 287 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:22:35,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1424 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-21 16:22:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-21 16:22:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 355. [2022-11-21 16:22:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 233 states have (on average 1.2317596566523605) internal successors, (287), 237 states have internal predecessors, (287), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-11-21 16:22:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 469 transitions. [2022-11-21 16:22:36,013 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 469 transitions. Word has length 139 [2022-11-21 16:22:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:22:36,014 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 469 transitions. [2022-11-21 16:22:36,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-21 16:22:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 469 transitions. [2022-11-21 16:22:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-21 16:22:36,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:22:36,017 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:22:36,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:22:36,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:22:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1333532262, now seen corresponding path program 1 times [2022-11-21 16:22:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447611780] [2022-11-21 16:22:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:22:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:22:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:22:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:22:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:22:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:22:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:22:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:22:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:22:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:22:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:22:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:22:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:22:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:22:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:22:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:22:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:22:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-21 16:22:37,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447611780] [2022-11-21 16:22:37,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447611780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:37,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:37,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:22:37,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787800125] [2022-11-21 16:22:37,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:37,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:22:37,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:37,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:22:37,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:22:37,896 INFO L87 Difference]: Start difference. First operand 355 states and 469 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-21 16:22:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:22:40,875 INFO L93 Difference]: Finished difference Result 443 states and 597 transitions. [2022-11-21 16:22:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:22:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2022-11-21 16:22:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:22:40,879 INFO L225 Difference]: With dead ends: 443 [2022-11-21 16:22:40,880 INFO L226 Difference]: Without dead ends: 441 [2022-11-21 16:22:40,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:22:40,881 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 419 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:22:40,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1220 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-21 16:22:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-21 16:22:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 359. [2022-11-21 16:22:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 236 states have (on average 1.228813559322034) internal successors, (290), 240 states have internal predecessors, (290), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-11-21 16:22:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2022-11-21 16:22:40,915 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 144 [2022-11-21 16:22:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:22:40,916 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2022-11-21 16:22:40,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-21 16:22:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2022-11-21 16:22:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-21 16:22:40,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:22:40,919 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:22:40,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:22:40,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:22:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1152708077, now seen corresponding path program 1 times [2022-11-21 16:22:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:40,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787387544] [2022-11-21 16:22:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:22:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:22:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:22:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:22:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:22:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:22:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:22:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:22:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:22:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:22:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:22:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:22:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:22:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:22:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:22:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:22:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:22:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 16:22:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-21 16:22:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-21 16:22:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:42,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787387544] [2022-11-21 16:22:42,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787387544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:42,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:42,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:22:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272319708] [2022-11-21 16:22:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:42,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:22:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:42,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:22:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:22:42,305 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-21 16:22:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:22:44,949 INFO L93 Difference]: Finished difference Result 449 states and 603 transitions. [2022-11-21 16:22:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:22:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2022-11-21 16:22:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:22:44,952 INFO L225 Difference]: With dead ends: 449 [2022-11-21 16:22:44,953 INFO L226 Difference]: Without dead ends: 447 [2022-11-21 16:22:44,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:22:44,954 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 528 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:22:44,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1156 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-21 16:22:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-21 16:22:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 364. [2022-11-21 16:22:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 239 states have (on average 1.2259414225941423) internal successors, (293), 244 states have internal predecessors, (293), 88 states have call successors, (88), 33 states have call predecessors, (88), 36 states have return successors, (96), 86 states have call predecessors, (96), 86 states have call successors, (96) [2022-11-21 16:22:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 477 transitions. [2022-11-21 16:22:44,983 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 477 transitions. Word has length 157 [2022-11-21 16:22:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:22:44,984 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 477 transitions. [2022-11-21 16:22:44,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-21 16:22:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 477 transitions. [2022-11-21 16:22:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-21 16:22:44,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:22:44,987 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:22:44,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:22:44,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:22:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1154555119, now seen corresponding path program 1 times [2022-11-21 16:22:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:44,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429931594] [2022-11-21 16:22:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:22:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:22:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:22:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:22:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:22:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:22:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:22:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:22:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:22:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:22:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:22:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:22:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:22:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:22:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:22:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 16:22:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:22:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 16:22:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-21 16:22:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-21 16:22:46,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:46,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429931594] [2022-11-21 16:22:46,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429931594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:46,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:46,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:22:46,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212785355] [2022-11-21 16:22:46,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:46,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:22:46,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:46,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:22:46,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:22:46,189 INFO L87 Difference]: Start difference. First operand 364 states and 477 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-21 16:22:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:22:49,067 INFO L93 Difference]: Finished difference Result 452 states and 605 transitions. [2022-11-21 16:22:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:22:49,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2022-11-21 16:22:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:22:49,072 INFO L225 Difference]: With dead ends: 452 [2022-11-21 16:22:49,072 INFO L226 Difference]: Without dead ends: 450 [2022-11-21 16:22:49,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:22:49,073 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 405 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:22:49,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1156 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-21 16:22:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-21 16:22:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 363. [2022-11-21 16:22:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 239 states have (on average 1.2259414225941423) internal successors, (293), 243 states have internal predecessors, (293), 87 states have call successors, (87), 33 states have call predecessors, (87), 36 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-11-21 16:22:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 475 transitions. [2022-11-21 16:22:49,123 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 475 transitions. Word has length 157 [2022-11-21 16:22:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:22:49,126 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 475 transitions. [2022-11-21 16:22:49,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-11-21 16:22:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 475 transitions. [2022-11-21 16:22:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-21 16:22:49,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:22:49,130 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:22:49,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:22:49,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:22:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash -3860359, now seen corresponding path program 1 times [2022-11-21 16:22:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:49,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028324499] [2022-11-21 16:22:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:22:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:22:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:22:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:22:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:22:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:22:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:22:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:22:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:22:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:22:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:22:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:22:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:22:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:22:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:22:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:22:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:22:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:22:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:51,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:22:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-21 16:22:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:51,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028324499] [2022-11-21 16:22:51,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028324499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:51,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:51,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-21 16:22:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076247681] [2022-11-21 16:22:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:51,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:22:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:22:51,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:22:51,133 INFO L87 Difference]: Start difference. First operand 363 states and 475 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 16:22:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:22:56,298 INFO L93 Difference]: Finished difference Result 843 states and 1149 transitions. [2022-11-21 16:22:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 16:22:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 172 [2022-11-21 16:22:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:22:56,304 INFO L225 Difference]: With dead ends: 843 [2022-11-21 16:22:56,304 INFO L226 Difference]: Without dead ends: 554 [2022-11-21 16:22:56,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-11-21 16:22:56,307 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 628 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:22:56,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2890 Invalid, 3683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3411 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-21 16:22:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-11-21 16:22:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 407. [2022-11-21 16:22:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 271 states have (on average 1.2435424354243543) internal successors, (337), 276 states have internal predecessors, (337), 95 states have call successors, (95), 36 states have call predecessors, (95), 40 states have return successors, (106), 94 states have call predecessors, (106), 93 states have call successors, (106) [2022-11-21 16:22:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2022-11-21 16:22:56,345 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 172 [2022-11-21 16:22:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:22:56,346 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2022-11-21 16:22:56,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 8 states have internal predecessors, (75), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 16:22:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2022-11-21 16:22:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-21 16:22:56,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:22:56,350 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:22:56,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:22:56,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:22:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:22:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1792726195, now seen corresponding path program 1 times [2022-11-21 16:22:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:22:56,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077934973] [2022-11-21 16:22:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:22:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:22:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:22:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:22:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:22:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:22:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:22:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:22:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:22:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:22:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:22:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:22:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:22:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:22:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:22:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:22:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:22:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 16:22:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:22:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:22:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:22:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:22:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 16:22:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:22:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-21 16:22:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:22:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077934973] [2022-11-21 16:22:57,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077934973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:22:57,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:22:57,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:22:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634844974] [2022-11-21 16:22:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:22:57,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:22:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:22:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:22:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:22:57,393 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-21 16:23:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:03,376 INFO L93 Difference]: Finished difference Result 758 states and 1015 transitions. [2022-11-21 16:23:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 16:23:03,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 170 [2022-11-21 16:23:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:03,381 INFO L225 Difference]: With dead ends: 758 [2022-11-21 16:23:03,381 INFO L226 Difference]: Without dead ends: 511 [2022-11-21 16:23:03,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:23:03,383 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 536 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:03,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1317 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-21 16:23:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-11-21 16:23:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 407. [2022-11-21 16:23:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 271 states have (on average 1.2287822878228782) internal successors, (333), 276 states have internal predecessors, (333), 95 states have call successors, (95), 36 states have call predecessors, (95), 40 states have return successors, (106), 94 states have call predecessors, (106), 93 states have call successors, (106) [2022-11-21 16:23:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 534 transitions. [2022-11-21 16:23:03,417 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 534 transitions. Word has length 170 [2022-11-21 16:23:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:03,417 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 534 transitions. [2022-11-21 16:23:03,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-21 16:23:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 534 transitions. [2022-11-21 16:23:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-21 16:23:03,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:03,421 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:23:03,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:23:03,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 12712139, now seen corresponding path program 1 times [2022-11-21 16:23:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:03,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111406796] [2022-11-21 16:23:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:23:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:23:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:23:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:23:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:23:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:23:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:23:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:23:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:23:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:23:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:23:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:23:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:23:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:23:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:23:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 16:23:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:23:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:23:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 16:23:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-21 16:23:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111406796] [2022-11-21 16:23:04,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111406796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:04,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:04,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:23:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110675826] [2022-11-21 16:23:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:04,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:23:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:04,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:23:04,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:23:04,547 INFO L87 Difference]: Start difference. First operand 407 states and 534 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 16:23:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:10,326 INFO L93 Difference]: Finished difference Result 647 states and 887 transitions. [2022-11-21 16:23:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:23:10,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2022-11-21 16:23:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:10,330 INFO L225 Difference]: With dead ends: 647 [2022-11-21 16:23:10,330 INFO L226 Difference]: Without dead ends: 576 [2022-11-21 16:23:10,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:23:10,332 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 741 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:10,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1517 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-21 16:23:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-11-21 16:23:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 413. [2022-11-21 16:23:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 275 states have (on average 1.2254545454545454) internal successors, (337), 281 states have internal predecessors, (337), 95 states have call successors, (95), 36 states have call predecessors, (95), 42 states have return successors, (108), 95 states have call predecessors, (108), 93 states have call successors, (108) [2022-11-21 16:23:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 540 transitions. [2022-11-21 16:23:10,365 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 540 transitions. Word has length 170 [2022-11-21 16:23:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:10,365 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 540 transitions. [2022-11-21 16:23:10,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 16:23:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 540 transitions. [2022-11-21 16:23:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-21 16:23:10,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:10,368 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:23:10,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:23:10,369 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1506166486, now seen corresponding path program 1 times [2022-11-21 16:23:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:10,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720707957] [2022-11-21 16:23:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:23:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:23:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:23:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:23:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:23:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:23:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:23:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:23:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:23:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:23:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:23:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:23:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:23:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:23:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:23:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:23:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:23:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:23:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:23:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-21 16:23:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:23:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-11-21 16:23:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720707957] [2022-11-21 16:23:12,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720707957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:23:12,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712710745] [2022-11-21 16:23:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:23:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:23:12,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:23:12,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:23:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:13,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 16:23:13,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:23:13,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:23:13,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 16:23:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-11-21 16:23:13,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:23:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-11-21 16:23:14,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712710745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:23:14,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:23:14,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 19 [2022-11-21 16:23:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018447923] [2022-11-21 16:23:14,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:23:14,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 16:23:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 16:23:14,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:23:14,449 INFO L87 Difference]: Start difference. First operand 413 states and 540 transitions. Second operand has 19 states, 16 states have (on average 6.3125) internal successors, (101), 14 states have internal predecessors, (101), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-21 16:23:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:19,940 INFO L93 Difference]: Finished difference Result 847 states and 1135 transitions. [2022-11-21 16:23:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 16:23:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 14 states have internal predecessors, (101), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) Word has length 176 [2022-11-21 16:23:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:19,952 INFO L225 Difference]: With dead ends: 847 [2022-11-21 16:23:19,952 INFO L226 Difference]: Without dead ends: 527 [2022-11-21 16:23:19,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 397 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-11-21 16:23:19,954 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 666 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:19,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2862 Invalid, 4205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-21 16:23:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-21 16:23:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 431. [2022-11-21 16:23:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 284 states have (on average 1.2183098591549295) internal successors, (346), 289 states have internal predecessors, (346), 103 states have call successors, (103), 38 states have call predecessors, (103), 43 states have return successors, (114), 103 states have call predecessors, (114), 101 states have call successors, (114) [2022-11-21 16:23:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2022-11-21 16:23:19,995 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 176 [2022-11-21 16:23:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:19,996 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2022-11-21 16:23:19,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.3125) internal successors, (101), 14 states have internal predecessors, (101), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-21 16:23:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2022-11-21 16:23:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-21 16:23:19,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:19,999 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:23:20,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:23:20,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 16:23:20,215 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash -204776121, now seen corresponding path program 1 times [2022-11-21 16:23:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:20,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934078613] [2022-11-21 16:23:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:23:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:23:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:23:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:23:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:23:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:23:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:23:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:23:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:23:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:23:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:23:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:23:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:23:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:23:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:23:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:23:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:23:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-21 16:23:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 16:23:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-21 16:23:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934078613] [2022-11-21 16:23:22,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934078613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:22,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:22,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-21 16:23:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244066939] [2022-11-21 16:23:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:22,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 16:23:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:22,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 16:23:22,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:23:22,289 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 9 states have internal predecessors, (79), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 16:23:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:28,011 INFO L93 Difference]: Finished difference Result 891 states and 1209 transitions. [2022-11-21 16:23:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 16:23:28,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 9 states have internal predecessors, (79), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 176 [2022-11-21 16:23:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:28,018 INFO L225 Difference]: With dead ends: 891 [2022-11-21 16:23:28,018 INFO L226 Difference]: Without dead ends: 599 [2022-11-21 16:23:28,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-11-21 16:23:28,020 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 479 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 3931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:28,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 3433 Invalid, 3931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-21 16:23:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-11-21 16:23:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 452. [2022-11-21 16:23:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 295 states have (on average 1.2135593220338983) internal successors, (358), 300 states have internal predecessors, (358), 111 states have call successors, (111), 40 states have call predecessors, (111), 45 states have return successors, (124), 111 states have call predecessors, (124), 109 states have call successors, (124) [2022-11-21 16:23:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 593 transitions. [2022-11-21 16:23:28,075 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 593 transitions. Word has length 176 [2022-11-21 16:23:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:28,075 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 593 transitions. [2022-11-21 16:23:28,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 9 states have internal predecessors, (79), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 16:23:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 593 transitions. [2022-11-21 16:23:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-21 16:23:28,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:28,079 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:23:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:23:28,080 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -200637153, now seen corresponding path program 1 times [2022-11-21 16:23:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:28,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052809210] [2022-11-21 16:23:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:23:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:23:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:23:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:23:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:23:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:23:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:23:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:23:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:23:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:23:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:23:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:23:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:23:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:23:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:23:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 16:23:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:23:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:23:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-21 16:23:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-21 16:23:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:28,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052809210] [2022-11-21 16:23:28,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052809210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:28,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:23:28,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:23:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102630159] [2022-11-21 16:23:28,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:28,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:23:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:23:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:23:28,755 INFO L87 Difference]: Start difference. First operand 452 states and 593 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 16:23:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:34,291 INFO L93 Difference]: Finished difference Result 805 states and 1074 transitions. [2022-11-21 16:23:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:23:34,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-11-21 16:23:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:34,296 INFO L225 Difference]: With dead ends: 805 [2022-11-21 16:23:34,296 INFO L226 Difference]: Without dead ends: 558 [2022-11-21 16:23:34,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:23:34,298 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 452 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:34,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 880 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-21 16:23:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-21 16:23:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 454. [2022-11-21 16:23:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 297 states have (on average 1.2121212121212122) internal successors, (360), 302 states have internal predecessors, (360), 111 states have call successors, (111), 40 states have call predecessors, (111), 45 states have return successors, (124), 111 states have call predecessors, (124), 109 states have call successors, (124) [2022-11-21 16:23:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 595 transitions. [2022-11-21 16:23:34,343 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 595 transitions. Word has length 172 [2022-11-21 16:23:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 595 transitions. [2022-11-21 16:23:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 16:23:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 595 transitions. [2022-11-21 16:23:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-21 16:23:34,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:34,348 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:23:34,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:23:34,349 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 155220128, now seen corresponding path program 1 times [2022-11-21 16:23:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:34,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050887425] [2022-11-21 16:23:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:23:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:23:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:23:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:23:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:23:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:23:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 16:23:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:23:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:23:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 16:23:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:23:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:23:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-21 16:23:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:23:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 16:23:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:23:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:23:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:23:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:23:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-21 16:23:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-21 16:23:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-21 16:23:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:23:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-11-21 16:23:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:23:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050887425] [2022-11-21 16:23:36,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050887425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:23:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426735603] [2022-11-21 16:23:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:23:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:23:36,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:23:36,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:23:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:23:37,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 2829 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-21 16:23:37,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:23:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-21 16:23:38,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:23:38,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426735603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:23:38,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:23:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-11-21 16:23:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926793557] [2022-11-21 16:23:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:23:38,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:23:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:23:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:23:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:23:38,176 INFO L87 Difference]: Start difference. First operand 454 states and 595 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-21 16:23:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:23:38,618 INFO L93 Difference]: Finished difference Result 901 states and 1179 transitions. [2022-11-21 16:23:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:23:38,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 186 [2022-11-21 16:23:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:23:38,622 INFO L225 Difference]: With dead ends: 901 [2022-11-21 16:23:38,622 INFO L226 Difference]: Without dead ends: 456 [2022-11-21 16:23:38,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:23:38,625 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 26 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:23:38,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 2372 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:23:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-11-21 16:23:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2022-11-21 16:23:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 298 states have (on average 1.2114093959731544) internal successors, (361), 304 states have internal predecessors, (361), 111 states have call successors, (111), 40 states have call predecessors, (111), 46 states have return successors, (125), 111 states have call predecessors, (125), 109 states have call successors, (125) [2022-11-21 16:23:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 597 transitions. [2022-11-21 16:23:38,672 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 597 transitions. Word has length 186 [2022-11-21 16:23:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:23:38,672 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 597 transitions. [2022-11-21 16:23:38,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-11-21 16:23:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 597 transitions. [2022-11-21 16:23:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-11-21 16:23:38,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:23:38,677 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:23:38,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:23:38,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 16:23:38,896 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:23:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:23:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1848729671, now seen corresponding path program 1 times [2022-11-21 16:23:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:23:38,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693769816] [2022-11-21 16:23:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:23:38,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 16:23:38,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681243438] [2022-11-21 16:23:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:23:38,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:23:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:23:38,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:23:39,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:32:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:13,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 402 conjunts are in the unsatisfiable core [2022-11-21 16:32:13,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:13,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:32:14,101 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:32:14,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:32:14,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:32:14,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:32:14,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 16:32:15,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:32:15,775 INFO L321 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-11-21 16:32:15,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 142 treesize of output 166 [2022-11-21 16:32:23,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:32:24,310 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 16:32:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 119 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-21 16:32:24,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:32:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:32:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693769816] [2022-11-21 16:32:27,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 16:32:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681243438] [2022-11-21 16:32:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681243438] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:32:27,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:32:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-11-21 16:32:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110663615] [2022-11-21 16:32:27,386 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:27,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 16:32:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:32:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 16:32:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2148, Unknown=48, NotChecked=0, Total=2352 [2022-11-21 16:32:27,388 INFO L87 Difference]: Start difference. First operand 456 states and 597 transitions. Second operand has 34 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 25 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-11-21 16:32:29,569 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-21 16:32:32,223 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-21 16:32:34,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:32:40,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:33:10,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 16:33:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:13,973 INFO L93 Difference]: Finished difference Result 991 states and 1275 transitions. [2022-11-21 16:33:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-21 16:33:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 25 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 192 [2022-11-21 16:33:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:13,979 INFO L225 Difference]: With dead ends: 991 [2022-11-21 16:33:13,979 INFO L226 Difference]: Without dead ends: 535 [2022-11-21 16:33:13,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=429, Invalid=5510, Unknown=67, NotChecked=0, Total=6006 [2022-11-21 16:33:13,984 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 501 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 8040 mSolverCounterSat, 362 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 8415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 8040 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:13,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 2673 Invalid, 8415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [362 Valid, 8040 Invalid, 13 Unknown, 0 Unchecked, 42.7s Time] [2022-11-21 16:33:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-11-21 16:33:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 520. [2022-11-21 16:33:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 340 states have (on average 1.1970588235294117) internal successors, (407), 347 states have internal predecessors, (407), 122 states have call successors, (122), 50 states have call predecessors, (122), 57 states have return successors, (139), 122 states have call predecessors, (139), 120 states have call successors, (139) [2022-11-21 16:33:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2022-11-21 16:33:14,051 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 192 [2022-11-21 16:33:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:14,052 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2022-11-21 16:33:14,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 25 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-11-21 16:33:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2022-11-21 16:33:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-21 16:33:14,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:14,057 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:33:14,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:14,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 16:33:14,271 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -708998723, now seen corresponding path program 1 times [2022-11-21 16:33:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:14,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129420775] [2022-11-21 16:33:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 16:33:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 16:33:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 16:33:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 16:33:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:33:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:33:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:33:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:33:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:33:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-21 16:33:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 16:33:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:33:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:33:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:33:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-21 16:33:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-21 16:33:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-21 16:33:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:33:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 16:33:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:33:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:33:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:33:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:33:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-21 16:33:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-21 16:33:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-21 16:33:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-21 16:33:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:33:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-11-21 16:33:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:15,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129420775] [2022-11-21 16:33:15,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129420775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:15,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:33:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926307906] [2022-11-21 16:33:15,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:15,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:33:15,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:15,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:33:15,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:33:15,545 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 16:33:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:19,357 INFO L93 Difference]: Finished difference Result 1102 states and 1435 transitions. [2022-11-21 16:33:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:33:19,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2022-11-21 16:33:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:19,361 INFO L225 Difference]: With dead ends: 1102 [2022-11-21 16:33:19,361 INFO L226 Difference]: Without dead ends: 591 [2022-11-21 16:33:19,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:33:19,364 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 395 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:19,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1635 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-21 16:33:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-21 16:33:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 519. [2022-11-21 16:33:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 340 states have (on average 1.1941176470588235) internal successors, (406), 346 states have internal predecessors, (406), 121 states have call successors, (121), 50 states have call predecessors, (121), 57 states have return successors, (137), 122 states have call predecessors, (137), 119 states have call successors, (137) [2022-11-21 16:33:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 664 transitions. [2022-11-21 16:33:19,429 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 664 transitions. Word has length 198 [2022-11-21 16:33:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:19,430 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 664 transitions. [2022-11-21 16:33:19,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 16:33:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 664 transitions. [2022-11-21 16:33:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-21 16:33:19,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:33:19,433 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:33:19,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:33:19,434 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:33:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:33:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1605235821, now seen corresponding path program 1 times [2022-11-21 16:33:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:33:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480985232] [2022-11-21 16:33:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:33:19,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 16:33:19,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479729174] [2022-11-21 16:33:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:33:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:33:19,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:33:19,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:33:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:33:20,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:33:20,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:33:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-11-21 16:33:20,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:33:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:33:20,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480985232] [2022-11-21 16:33:20,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 16:33:20,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479729174] [2022-11-21 16:33:20,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479729174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:33:20,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:33:20,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:33:20,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419286511] [2022-11-21 16:33:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:33:20,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:33:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:33:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:33:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:33:20,769 INFO L87 Difference]: Start difference. First operand 519 states and 664 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 16:33:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:33:20,844 INFO L93 Difference]: Finished difference Result 574 states and 720 transitions. [2022-11-21 16:33:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:33:20,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 198 [2022-11-21 16:33:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:33:20,846 INFO L225 Difference]: With dead ends: 574 [2022-11-21 16:33:20,846 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:33:20,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:33:20,849 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:33:20,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 343 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:33:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:33:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:33:20,850 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-21 16:33:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:33:20,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2022-11-21 16:33:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:33:20,851 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:33:20,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 16:33:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:33:20,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:33:20,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:33:20,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:33:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:33:21,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:33:23,726 INFO L902 garLoopResultBuilder]: At program point L7342(line 7342) the Hoare annotation is: true [2022-11-21 16:33:23,726 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsFINAL(lines 7331 7345) no Hoare annotation was computed. [2022-11-21 16:33:23,726 INFO L899 garLoopResultBuilder]: For program point L7339-1(line 7339) no Hoare annotation was computed. [2022-11-21 16:33:23,726 INFO L902 garLoopResultBuilder]: At program point L7339(line 7339) the Hoare annotation is: true [2022-11-21 16:33:23,726 INFO L899 garLoopResultBuilder]: For program point L7342-3(line 7342) no Hoare annotation was computed. [2022-11-21 16:33:23,726 INFO L899 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2022-11-21 16:33:23,726 INFO L902 garLoopResultBuilder]: At program point L7342-2(line 7342) the Hoare annotation is: true [2022-11-21 16:33:23,726 INFO L899 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2022-11-21 16:33:23,727 INFO L902 garLoopResultBuilder]: At program point L7342-1(line 7342) the Hoare annotation is: true [2022-11-21 16:33:23,727 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsEXIT(lines 7331 7345) no Hoare annotation was computed. [2022-11-21 16:33:23,727 INFO L899 garLoopResultBuilder]: For program point L7335-1(line 7335) no Hoare annotation was computed. [2022-11-21 16:33:23,727 INFO L902 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: true [2022-11-21 16:33:23,727 INFO L902 garLoopResultBuilder]: At program point L7337-1(line 7337) the Hoare annotation is: true [2022-11-21 16:33:23,727 INFO L902 garLoopResultBuilder]: At program point uninterpreted_equalsENTRY(lines 7331 7345) the Hoare annotation is: true [2022-11-21 16:33:23,727 INFO L902 garLoopResultBuilder]: At program point L7337(line 7337) the Hoare annotation is: true [2022-11-21 16:33:23,728 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-11-21 16:33:23,728 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104|)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2|) 0) (+ 442721857768999609256 (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 24) (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 442721857769029238784)))) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|) 1)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 4)) (= |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,729 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104|)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2|) 0) (+ 442721857768999609256 (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 24) (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 442721857769029238784)))) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|) 1)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 4)) (= |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_12|))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,729 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-11-21 16:33:23,729 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-11-21 16:33:23,729 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_equalsENTRY(line 239) the Hoare annotation is: true [2022-11-21 16:33:23,730 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsFINAL(line 239) no Hoare annotation was computed. [2022-11-21 16:33:23,730 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsEXIT(line 239) no Hoare annotation was computed. [2022-11-21 16:33:23,730 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherEXIT(line 238) no Hoare annotation was computed. [2022-11-21 16:33:23,730 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_hasherENTRY(line 238) the Hoare annotation is: true [2022-11-21 16:33:23,730 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherFINAL(line 238) no Hoare annotation was computed. [2022-11-21 16:33:23,731 INFO L899 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2022-11-21 16:33:23,731 INFO L902 garLoopResultBuilder]: At program point L10008-4(line 10008) the Hoare annotation is: true [2022-11-21 16:33:23,731 INFO L899 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2022-11-21 16:33:23,731 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10006 10009) the Hoare annotation is: true [2022-11-21 16:33:23,731 INFO L899 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2022-11-21 16:33:23,732 INFO L899 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2022-11-21 16:33:23,732 INFO L899 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2022-11-21 16:33:23,732 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10006 10009) no Hoare annotation was computed. [2022-11-21 16:33:23,732 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10006 10009) no Hoare annotation was computed. [2022-11-21 16:33:23,732 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-21 16:33:23,732 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-21 16:33:23,733 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-21 16:33:23,733 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-11-21 16:33:23,733 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-11-21 16:33:23,733 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-11-21 16:33:23,733 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-11-21 16:33:23,734 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-11-21 16:33:23,734 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-11-21 16:33:23,734 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-11-21 16:33:23,734 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-11-21 16:33:23,735 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10119 10131) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,735 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10119 10131) no Hoare annotation was computed. [2022-11-21 16:33:23,735 INFO L899 garLoopResultBuilder]: For program point L10126-1(line 10126) no Hoare annotation was computed. [2022-11-21 16:33:23,735 INFO L899 garLoopResultBuilder]: For program point L10126-2(lines 10126 10128) no Hoare annotation was computed. [2022-11-21 16:33:23,736 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0) (exists ((v_ArrVal_3048 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3048) |#valid|)))) [2022-11-21 16:33:23,736 INFO L895 garLoopResultBuilder]: At program point L10126(line 10126) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (let ((.cse0 (* |hash_table_state_required_bytes_#in~size| 24))) (and (= .cse0 |hash_table_state_required_bytes_#t~mem1320|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0) (exists ((v_ArrVal_3048 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3048) |#valid|)) (= (select (select |#memory_int| |hash_table_state_required_bytes_~#elemsize~0.base|) |hash_table_state_required_bytes_~#elemsize~0.offset|) .cse0)))) [2022-11-21 16:33:23,736 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10119 10131) no Hoare annotation was computed. [2022-11-21 16:33:23,736 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2022-11-21 16:33:23,737 INFO L899 garLoopResultBuilder]: For program point L10122-2(lines 10122 10124) no Hoare annotation was computed. [2022-11-21 16:33:23,737 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,737 INFO L902 garLoopResultBuilder]: At program point L6940(lines 6934 6941) the Hoare annotation is: true [2022-11-21 16:33:23,737 INFO L902 garLoopResultBuilder]: At program point L6936-2(line 6936) the Hoare annotation is: true [2022-11-21 16:33:23,737 INFO L899 garLoopResultBuilder]: For program point L6936-1(line 6936) no Hoare annotation was computed. [2022-11-21 16:33:23,738 INFO L902 garLoopResultBuilder]: At program point L6936(line 6936) the Hoare annotation is: true [2022-11-21 16:33:23,738 INFO L899 garLoopResultBuilder]: For program point L6937-1(lines 6937 6939) no Hoare annotation was computed. [2022-11-21 16:33:23,738 INFO L902 garLoopResultBuilder]: At program point L6937(lines 6937 6939) the Hoare annotation is: true [2022-11-21 16:33:23,738 INFO L899 garLoopResultBuilder]: For program point L6936-3(line 6936) no Hoare annotation was computed. [2022-11-21 16:33:23,738 INFO L899 garLoopResultBuilder]: For program point can_fail_callocEXIT(lines 6954 6958) no Hoare annotation was computed. [2022-11-21 16:33:23,739 INFO L899 garLoopResultBuilder]: For program point L6955-1(lines 6955 6957) no Hoare annotation was computed. [2022-11-21 16:33:23,739 INFO L902 garLoopResultBuilder]: At program point can_fail_callocENTRY(lines 6954 6958) the Hoare annotation is: true [2022-11-21 16:33:23,739 INFO L902 garLoopResultBuilder]: At program point L6955(line 6955) the Hoare annotation is: true [2022-11-21 16:33:23,739 INFO L899 garLoopResultBuilder]: For program point can_fail_callocFINAL(lines 6954 6958) no Hoare annotation was computed. [2022-11-21 16:33:23,739 INFO L899 garLoopResultBuilder]: For program point L6955-3(lines 6955 6957) no Hoare annotation was computed. [2022-11-21 16:33:23,740 INFO L902 garLoopResultBuilder]: At program point L2657(lines 2637 2658) the Hoare annotation is: true [2022-11-21 16:33:23,740 INFO L899 garLoopResultBuilder]: For program point L9210(lines 9210 9212) no Hoare annotation was computed. [2022-11-21 16:33:23,740 INFO L899 garLoopResultBuilder]: For program point L9202(lines 9202 9204) no Hoare annotation was computed. [2022-11-21 16:33:23,740 INFO L899 garLoopResultBuilder]: For program point L9210-2(lines 9210 9212) no Hoare annotation was computed. [2022-11-21 16:33:23,740 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-11-21 16:33:23,740 INFO L902 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: true [2022-11-21 16:33:23,741 INFO L899 garLoopResultBuilder]: For program point L9196(lines 9196 9198) no Hoare annotation was computed. [2022-11-21 16:33:23,741 INFO L899 garLoopResultBuilder]: For program point L9196-2(lines 9196 9198) no Hoare annotation was computed. [2022-11-21 16:33:23,741 INFO L899 garLoopResultBuilder]: For program point L2642(lines 2642 2644) no Hoare annotation was computed. [2022-11-21 16:33:23,741 INFO L899 garLoopResultBuilder]: For program point L2638(lines 2638 2641) no Hoare annotation was computed. [2022-11-21 16:33:23,741 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeEXIT(lines 9193 9218) no Hoare annotation was computed. [2022-11-21 16:33:23,742 INFO L902 garLoopResultBuilder]: At program point s_update_template_sizeENTRY(lines 9193 9218) the Hoare annotation is: true [2022-11-21 16:33:23,742 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeFINAL(lines 9193 9218) no Hoare annotation was computed. [2022-11-21 16:33:23,742 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6984 6987) no Hoare annotation was computed. [2022-11-21 16:33:23,742 INFO L902 garLoopResultBuilder]: At program point L6986(line 6986) the Hoare annotation is: true [2022-11-21 16:33:23,742 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6984 6987) the Hoare annotation is: true [2022-11-21 16:33:23,743 INFO L899 garLoopResultBuilder]: For program point L6986-1(line 6986) no Hoare annotation was computed. [2022-11-21 16:33:23,743 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6984 6987) no Hoare annotation was computed. [2022-11-21 16:33:23,743 INFO L902 garLoopResultBuilder]: At program point L9150-1(line 9150) the Hoare annotation is: true [2022-11-21 16:33:23,743 INFO L902 garLoopResultBuilder]: At program point s_hash_keys_eqENTRY(lines 9147 9155) the Hoare annotation is: true [2022-11-21 16:33:23,743 INFO L899 garLoopResultBuilder]: For program point L9150-2(line 9150) no Hoare annotation was computed. [2022-11-21 16:33:23,743 INFO L899 garLoopResultBuilder]: For program point s_hash_keys_eqEXIT(lines 9147 9155) no Hoare annotation was computed. [2022-11-21 16:33:23,744 INFO L902 garLoopResultBuilder]: At program point L9153(line 9153) the Hoare annotation is: true [2022-11-21 16:33:23,744 INFO L902 garLoopResultBuilder]: At program point L9154-1(line 9154) the Hoare annotation is: true [2022-11-21 16:33:23,744 INFO L899 garLoopResultBuilder]: For program point L9153-1(line 9153) no Hoare annotation was computed. [2022-11-21 16:33:23,744 INFO L899 garLoopResultBuilder]: For program point L9154-2(line 9154) no Hoare annotation was computed. [2022-11-21 16:33:23,744 INFO L902 garLoopResultBuilder]: At program point L9154-3(line 9154) the Hoare annotation is: true [2022-11-21 16:33:23,745 INFO L902 garLoopResultBuilder]: At program point L9150(line 9150) the Hoare annotation is: true [2022-11-21 16:33:23,745 INFO L899 garLoopResultBuilder]: For program point L9154-4(lines 9147 9155) no Hoare annotation was computed. [2022-11-21 16:33:23,745 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-11-21 16:33:23,745 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-11-21 16:33:23,745 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-11-21 16:33:23,746 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,746 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0)))) (.cse1 (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|)) (.cse2 (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|)) (.cse3 (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|)) (.cse4 (= |old(#valid)| |#valid|)) (.cse5 (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) .cse0 .cse1 (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse2 .cse3 (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0) .cse4 .cse5) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse1 .cse2 (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5))) [2022-11-21 16:33:23,747 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (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)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-21 16:33:23,747 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-11-21 16:33:23,747 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-21 16:33:23,748 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-21 16:33:23,748 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-21 16:33:23,748 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-21 16:33:23,748 INFO L899 garLoopResultBuilder]: For program point L9115(line 9115) no Hoare annotation was computed. [2022-11-21 16:33:23,748 INFO L902 garLoopResultBuilder]: At program point L9115-1(lines 9100 9116) the Hoare annotation is: true [2022-11-21 16:33:23,749 INFO L899 garLoopResultBuilder]: For program point L9115-2(lines 9100 9116) no Hoare annotation was computed. [2022-11-21 16:33:23,749 INFO L902 garLoopResultBuilder]: At program point L9101(line 9101) the Hoare annotation is: true [2022-11-21 16:33:23,749 INFO L902 garLoopResultBuilder]: At program point L9101-1(line 9101) the Hoare annotation is: true [2022-11-21 16:33:23,749 INFO L899 garLoopResultBuilder]: For program point L9101-2(line 9101) no Hoare annotation was computed. [2022-11-21 16:33:23,749 INFO L902 garLoopResultBuilder]: At program point L7373-1(lines 7369 7374) the Hoare annotation is: true [2022-11-21 16:33:23,750 INFO L899 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2022-11-21 16:33:23,750 INFO L899 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2022-11-21 16:33:23,750 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-11-21 16:33:23,750 INFO L899 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2022-11-21 16:33:23,750 INFO L902 garLoopResultBuilder]: At program point s_hash_forENTRY(lines 9100 9116) the Hoare annotation is: true [2022-11-21 16:33:23,750 INFO L902 garLoopResultBuilder]: At program point L7370(lines 7370 7372) the Hoare annotation is: true [2022-11-21 16:33:23,751 INFO L899 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2022-11-21 16:33:23,751 INFO L899 garLoopResultBuilder]: For program point s_hash_forEXIT(lines 9100 9116) no Hoare annotation was computed. [2022-11-21 16:33:23,751 INFO L902 garLoopResultBuilder]: At program point L7370-1(lines 7370 7372) the Hoare annotation is: true [2022-11-21 16:33:23,751 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,752 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-11-21 16:33:23,752 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-11-21 16:33:23,752 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,752 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,752 INFO L902 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: true [2022-11-21 16:33:23,753 INFO L899 garLoopResultBuilder]: For program point L7356(line 7356) no Hoare annotation was computed. [2022-11-21 16:33:23,753 INFO L902 garLoopResultBuilder]: At program point L7350(lines 7350 7352) the Hoare annotation is: true [2022-11-21 16:33:23,753 INFO L902 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: true [2022-11-21 16:33:23,753 INFO L902 garLoopResultBuilder]: At program point L7353(lines 7353 7355) the Hoare annotation is: true [2022-11-21 16:33:23,753 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,754 INFO L899 garLoopResultBuilder]: For program point L7284(lines 7284 7286) no Hoare annotation was computed. [2022-11-21 16:33:23,754 INFO L902 garLoopResultBuilder]: At program point L7350-1(lines 7350 7352) the Hoare annotation is: true [2022-11-21 16:33:23,754 INFO L902 garLoopResultBuilder]: At program point L7281-1(lines 7281 7283) the Hoare annotation is: true [2022-11-21 16:33:23,754 INFO L902 garLoopResultBuilder]: At program point L7281(lines 7281 7283) the Hoare annotation is: true [2022-11-21 16:33:23,754 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,754 INFO L902 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: true [2022-11-21 16:33:23,755 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2022-11-21 16:33:23,755 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createEXIT(lines 9516 9580) no Hoare annotation was computed. [2022-11-21 16:33:23,755 INFO L899 garLoopResultBuilder]: For program point L9533(lines 9533 9539) no Hoare annotation was computed. [2022-11-21 16:33:23,755 INFO L899 garLoopResultBuilder]: For program point L9504(lines 9504 9507) no Hoare annotation was computed. [2022-11-21 16:33:23,755 INFO L899 garLoopResultBuilder]: For program point L9546(lines 9546 9561) no Hoare annotation was computed. [2022-11-21 16:33:23,756 INFO L902 garLoopResultBuilder]: At program point L9571(line 9571) the Hoare annotation is: true [2022-11-21 16:33:23,756 INFO L899 garLoopResultBuilder]: For program point L9571-1(line 9571) no Hoare annotation was computed. [2022-11-21 16:33:23,756 INFO L902 garLoopResultBuilder]: At program point L9513(lines 9484 9514) the Hoare annotation is: true [2022-11-21 16:33:23,756 INFO L899 garLoopResultBuilder]: For program point L9546-2(lines 9546 9561) no Hoare annotation was computed. [2022-11-21 16:33:23,756 INFO L899 garLoopResultBuilder]: For program point L9534-2(lines 9534 9536) no Hoare annotation was computed. [2022-11-21 16:33:23,757 INFO L899 garLoopResultBuilder]: For program point L9534(lines 9534 9536) no Hoare annotation was computed. [2022-11-21 16:33:23,757 INFO L902 garLoopResultBuilder]: At program point L9493(line 9493) the Hoare annotation is: true [2022-11-21 16:33:23,757 INFO L899 garLoopResultBuilder]: For program point L9493-1(line 9493) no Hoare annotation was computed. [2022-11-21 16:33:23,757 INFO L899 garLoopResultBuilder]: For program point L9493-2(lines 9493 9495) no Hoare annotation was computed. [2022-11-21 16:33:23,757 INFO L902 garLoopResultBuilder]: At program point L9497(line 9497) the Hoare annotation is: true [2022-11-21 16:33:23,757 INFO L899 garLoopResultBuilder]: For program point L9497-1(line 9497) no Hoare annotation was computed. [2022-11-21 16:33:23,758 INFO L902 garLoopResultBuilder]: At program point L9489(line 9489) the Hoare annotation is: true [2022-11-21 16:33:23,758 INFO L899 garLoopResultBuilder]: For program point L9489-1(line 9489) no Hoare annotation was computed. [2022-11-21 16:33:23,758 INFO L899 garLoopResultBuilder]: For program point L9489-2(lines 9489 9491) no Hoare annotation was computed. [2022-11-21 16:33:23,758 INFO L899 garLoopResultBuilder]: For program point L9543-2(lines 9543 9545) no Hoare annotation was computed. [2022-11-21 16:33:23,758 INFO L902 garLoopResultBuilder]: At program point L9506(line 9506) the Hoare annotation is: true [2022-11-21 16:33:23,759 INFO L902 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: true [2022-11-21 16:33:23,759 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-11-21 16:33:23,759 INFO L899 garLoopResultBuilder]: For program point L9502-1(lines 9502 9508) no Hoare annotation was computed. [2022-11-21 16:33:23,759 INFO L899 garLoopResultBuilder]: For program point L9531(line 9531) no Hoare annotation was computed. [2022-11-21 16:33:23,759 INFO L899 garLoopResultBuilder]: For program point L9502-3(lines 9502 9508) no Hoare annotation was computed. [2022-11-21 16:33:23,760 INFO L899 garLoopResultBuilder]: For program point L9498(lines 9498 9500) no Hoare annotation was computed. [2022-11-21 16:33:23,760 INFO L902 garLoopResultBuilder]: At program point L9502-4(lines 9502 9508) the Hoare annotation is: true [2022-11-21 16:33:23,760 INFO L899 garLoopResultBuilder]: For program point L9506-1(line 9506) no Hoare annotation was computed. [2022-11-21 16:33:23,760 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_createENTRY(lines 9516 9580) the Hoare annotation is: true [2022-11-21 16:33:23,760 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createFINAL(lines 9516 9580) no Hoare annotation was computed. [2022-11-21 16:33:23,760 INFO L902 garLoopResultBuilder]: At program point L9527-2(lines 9527 9529) the Hoare annotation is: true [2022-11-21 16:33:23,761 INFO L902 garLoopResultBuilder]: At program point L9523(line 9523) the Hoare annotation is: true [2022-11-21 16:33:23,761 INFO L899 garLoopResultBuilder]: For program point L9523-1(line 9523) no Hoare annotation was computed. [2022-11-21 16:33:23,761 INFO L899 garLoopResultBuilder]: For program point L9502-5(lines 9502 9508) no Hoare annotation was computed. [2022-11-21 16:33:23,761 INFO L899 garLoopResultBuilder]: For program point L9527(lines 9527 9529) no Hoare annotation was computed. [2022-11-21 16:33:23,762 INFO L899 garLoopResultBuilder]: For program point L9548(lines 9548 9551) no Hoare annotation was computed. [2022-11-21 16:33:23,762 INFO L899 garLoopResultBuilder]: For program point L9573(lines 9573 9575) no Hoare annotation was computed. [2022-11-21 16:33:23,762 INFO L899 garLoopResultBuilder]: For program point L9573-2(lines 9573 9575) no Hoare annotation was computed. [2022-11-21 16:33:23,762 INFO L902 garLoopResultBuilder]: At program point L9511(line 9511) the Hoare annotation is: true [2022-11-21 16:33:23,762 INFO L899 garLoopResultBuilder]: For program point L9511-1(line 9511) no Hoare annotation was computed. [2022-11-21 16:33:23,762 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10017 10064) the Hoare annotation is: true [2022-11-21 16:33:23,763 INFO L902 garLoopResultBuilder]: At program point L10045(line 10045) the Hoare annotation is: true [2022-11-21 16:33:23,763 INFO L899 garLoopResultBuilder]: For program point L10045-1(line 10045) no Hoare annotation was computed. [2022-11-21 16:33:23,763 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10017 10064) no Hoare annotation was computed. [2022-11-21 16:33:23,763 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10017 10064) no Hoare annotation was computed. [2022-11-21 16:33:23,763 INFO L899 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2022-11-21 16:33:23,764 INFO L899 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2022-11-21 16:33:23,764 INFO L902 garLoopResultBuilder]: At program point s_safe_eq_checkENTRY(lines 9121 9142) the Hoare annotation is: true [2022-11-21 16:33:23,764 INFO L899 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2022-11-21 16:33:23,764 INFO L902 garLoopResultBuilder]: At program point L9141(line 9141) the Hoare annotation is: true [2022-11-21 16:33:23,764 INFO L899 garLoopResultBuilder]: For program point L9141-1(line 9141) no Hoare annotation was computed. [2022-11-21 16:33:23,765 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkFINAL(lines 9121 9142) no Hoare annotation was computed. [2022-11-21 16:33:23,765 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkEXIT(lines 9121 9142) no Hoare annotation was computed. [2022-11-21 16:33:23,765 INFO L902 garLoopResultBuilder]: At program point L9173(line 9173) the Hoare annotation is: true [2022-11-21 16:33:23,765 INFO L899 garLoopResultBuilder]: For program point L9173-1(line 9173) no Hoare annotation was computed. [2022-11-21 16:33:23,765 INFO L899 garLoopResultBuilder]: For program point L9173-2(lines 9173 9177) no Hoare annotation was computed. [2022-11-21 16:33:23,766 INFO L902 garLoopResultBuilder]: At program point s_alloc_stateENTRY(lines 9171 9190) the Hoare annotation is: true [2022-11-21 16:33:23,766 INFO L902 garLoopResultBuilder]: At program point L7018(line 7018) the Hoare annotation is: true [2022-11-21 16:33:23,766 INFO L902 garLoopResultBuilder]: At program point L7020(lines 7001 7021) the Hoare annotation is: true [2022-11-21 16:33:23,766 INFO L899 garLoopResultBuilder]: For program point L7016-1(line 7016) no Hoare annotation was computed. [2022-11-21 16:33:23,766 INFO L902 garLoopResultBuilder]: At program point L7016(line 7016) the Hoare annotation is: true [2022-11-21 16:33:23,767 INFO L899 garLoopResultBuilder]: For program point L7018-1(line 7018) no Hoare annotation was computed. [2022-11-21 16:33:23,767 INFO L902 garLoopResultBuilder]: At program point L7010(line 7010) the Hoare annotation is: true [2022-11-21 16:33:23,767 INFO L899 garLoopResultBuilder]: For program point L7010-2(lines 7010 7014) no Hoare annotation was computed. [2022-11-21 16:33:23,767 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateEXIT(lines 9171 9190) no Hoare annotation was computed. [2022-11-21 16:33:23,767 INFO L899 garLoopResultBuilder]: For program point L7010-1(line 7010) no Hoare annotation was computed. [2022-11-21 16:33:23,768 INFO L902 garLoopResultBuilder]: At program point L7002(line 7002) the Hoare annotation is: true [2022-11-21 16:33:23,768 INFO L899 garLoopResultBuilder]: For program point L7004-1(line 7004) no Hoare annotation was computed. [2022-11-21 16:33:23,768 INFO L902 garLoopResultBuilder]: At program point L7004(line 7004) the Hoare annotation is: true [2022-11-21 16:33:23,768 INFO L899 garLoopResultBuilder]: For program point L9182(lines 9182 9186) no Hoare annotation was computed. [2022-11-21 16:33:23,768 INFO L899 garLoopResultBuilder]: For program point L7002-2(line 7002) no Hoare annotation was computed. [2022-11-21 16:33:23,768 INFO L902 garLoopResultBuilder]: At program point L7002-1(line 7002) the Hoare annotation is: true [2022-11-21 16:33:23,769 INFO L899 garLoopResultBuilder]: For program point L7017-2(lines 7017 7019) no Hoare annotation was computed. [2022-11-21 16:33:23,769 INFO L899 garLoopResultBuilder]: For program point L7017(lines 7017 7019) no Hoare annotation was computed. [2022-11-21 16:33:23,769 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateFINAL(lines 9171 9190) no Hoare annotation was computed. [2022-11-21 16:33:23,769 INFO L902 garLoopResultBuilder]: At program point L9437-1(line 9437) the Hoare annotation is: true [2022-11-21 16:33:23,769 INFO L899 garLoopResultBuilder]: For program point L9437-2(line 9437) no Hoare annotation was computed. [2022-11-21 16:33:23,770 INFO L902 garLoopResultBuilder]: At program point L9437-3(lines 9437 9439) the Hoare annotation is: true [2022-11-21 16:33:23,770 INFO L902 garLoopResultBuilder]: At program point L9478-5(lines 9433 9482) the Hoare annotation is: true [2022-11-21 16:33:23,770 INFO L899 garLoopResultBuilder]: For program point L9478-6(lines 9478 9481) no Hoare annotation was computed. [2022-11-21 16:33:23,770 INFO L902 garLoopResultBuilder]: At program point L9462-2(lines 9448 9476) the Hoare annotation is: true [2022-11-21 16:33:23,770 INFO L899 garLoopResultBuilder]: For program point L9462(lines 9462 9475) no Hoare annotation was computed. [2022-11-21 16:33:23,771 INFO L902 garLoopResultBuilder]: At program point s_emplace_itemENTRY(lines 9430 9482) the Hoare annotation is: true [2022-11-21 16:33:23,771 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemFINAL(lines 9430 9482) no Hoare annotation was computed. [2022-11-21 16:33:23,771 INFO L902 garLoopResultBuilder]: At program point L9434(line 9434) the Hoare annotation is: true [2022-11-21 16:33:23,771 INFO L902 garLoopResultBuilder]: At program point L9434-1(line 9434) the Hoare annotation is: true [2022-11-21 16:33:23,771 INFO L899 garLoopResultBuilder]: For program point L9434-2(line 9434) no Hoare annotation was computed. [2022-11-21 16:33:23,772 INFO L899 garLoopResultBuilder]: For program point L9464(lines 9464 9466) no Hoare annotation was computed. [2022-11-21 16:33:23,772 INFO L899 garLoopResultBuilder]: For program point L9464-2(lines 9464 9466) no Hoare annotation was computed. [2022-11-21 16:33:23,772 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemEXIT(lines 9430 9482) no Hoare annotation was computed. [2022-11-21 16:33:23,772 INFO L899 garLoopResultBuilder]: For program point L9448-1(lines 9448 9476) no Hoare annotation was computed. [2022-11-21 16:33:23,772 INFO L899 garLoopResultBuilder]: For program point L9436(lines 9436 9440) no Hoare annotation was computed. [2022-11-21 16:33:23,773 INFO L899 garLoopResultBuilder]: For program point L9436-1(lines 9436 9440) no Hoare annotation was computed. [2022-11-21 16:33:23,773 INFO L899 garLoopResultBuilder]: For program point L9478-1(line 9478) no Hoare annotation was computed. [2022-11-21 16:33:23,773 INFO L902 garLoopResultBuilder]: At program point L9478-3(line 9478) the Hoare annotation is: true [2022-11-21 16:33:23,773 INFO L899 garLoopResultBuilder]: For program point L9478-4(line 9478) no Hoare annotation was computed. [2022-11-21 16:33:23,773 INFO L899 garLoopResultBuilder]: For program point L9478(line 9478) no Hoare annotation was computed. [2022-11-21 16:33:23,773 INFO L899 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2022-11-21 16:33:23,774 INFO L899 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2022-11-21 16:33:23,774 INFO L899 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2022-11-21 16:33:23,774 INFO L899 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2022-11-21 16:33:23,774 INFO L899 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2022-11-21 16:33:23,774 INFO L899 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2022-11-21 16:33:23,775 INFO L899 garLoopResultBuilder]: For program point s_find_entryFINAL(lines 9321 9346) no Hoare annotation was computed. [2022-11-21 16:33:23,775 INFO L899 garLoopResultBuilder]: For program point s_find_entryEXIT(lines 9321 9346) no Hoare annotation was computed. [2022-11-21 16:33:23,775 INFO L902 garLoopResultBuilder]: At program point s_find_entryENTRY(lines 9321 9346) the Hoare annotation is: true [2022-11-21 16:33:23,775 INFO L899 garLoopResultBuilder]: For program point L9377-4(lines 9377 9380) no Hoare annotation was computed. [2022-11-21 16:33:23,775 INFO L899 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2022-11-21 16:33:23,776 INFO L899 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2022-11-21 16:33:23,776 INFO L902 garLoopResultBuilder]: At program point L9377-1(line 9377) the Hoare annotation is: true [2022-11-21 16:33:23,776 INFO L899 garLoopResultBuilder]: For program point L9377-2(line 9377) no Hoare annotation was computed. [2022-11-21 16:33:23,776 INFO L902 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: true [2022-11-21 16:33:23,777 INFO L902 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: true [2022-11-21 16:33:23,777 INFO L899 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2022-11-21 16:33:23,777 INFO L899 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2022-11-21 16:33:23,777 INFO L899 garLoopResultBuilder]: For program point L9337-4(lines 9337 9343) no Hoare annotation was computed. [2022-11-21 16:33:23,777 INFO L899 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2022-11-21 16:33:23,778 INFO L902 garLoopResultBuilder]: At program point L9337-1(line 9337) the Hoare annotation is: true [2022-11-21 16:33:23,778 INFO L899 garLoopResultBuilder]: For program point L9337-2(line 9337) no Hoare annotation was computed. [2022-11-21 16:33:23,778 INFO L899 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2022-11-21 16:33:23,778 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-21 16:33:23,778 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-21 16:33:23,778 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-21 16:33:23,779 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-21 16:33:23,779 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (forall ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (let ((.cse0 (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_78|))) (or (not (= .cse0 0)) (not (= .cse0 v_ArrVal_3049)))))) [2022-11-21 16:33:23,779 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-11-21 16:33:23,779 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-11-21 16:33:23,780 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-11-21 16:33:23,780 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-11-21 16:33:23,780 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-11-21 16:33:23,780 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-11-21 16:33:23,781 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,781 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-11-21 16:33:23,781 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-11-21 16:33:23,781 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-11-21 16:33:23,781 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-11-21 16:33:23,782 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-11-21 16:33:23,782 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|)) (.cse1 (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|)) (.cse2 (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|)) (.cse3 (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0)))) (.cse4 (= ~tl_last_error~0 |old(~tl_last_error~0)|)) (.cse5 (= |old(#valid)| |#valid|)) (.cse6 (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and .cse0 (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse3 (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) .cse4) .cse5 .cse6))) [2022-11-21 16:33:23,782 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-21 16:33:23,783 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1)))) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-11-21 16:33:23,783 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-11-21 16:33:23,783 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (exists ((v_ArrVal_3049 Int) (|v___CPROVER_overflow_mult_~#c~1.base_78| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78| v_ArrVal_3049) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_78|) 0))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7| Int)) (or (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7|) 1))))) [2022-11-21 16:33:23,784 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-11-21 16:33:23,784 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-11-21 16:33:23,784 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-11-21 16:33:23,784 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-11-21 16:33:23,784 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-21 16:33:23,785 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-21 16:33:23,785 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-21 16:33:23,785 INFO L902 garLoopResultBuilder]: At program point L10176(line 10176) the Hoare annotation is: true [2022-11-21 16:33:23,786 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-11-21 16:33:23,786 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0))) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (.cse3 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) (or (and .cse0 (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 1) 0) .cse1 .cse2 .cse3) (and .cse0 (= (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256) (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) .cse1 (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse2 .cse3))) [2022-11-21 16:33:23,786 INFO L899 garLoopResultBuilder]: For program point L10135-2(line 10135) no Hoare annotation was computed. [2022-11-21 16:33:23,786 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-11-21 16:33:23,787 INFO L899 garLoopResultBuilder]: For program point L10164(line 10164) no Hoare annotation was computed. [2022-11-21 16:33:23,787 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-11-21 16:33:23,787 INFO L895 garLoopResultBuilder]: At program point L10164-2(line 10164) the Hoare annotation is: false [2022-11-21 16:33:23,787 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: false [2022-11-21 16:33:23,787 INFO L895 garLoopResultBuilder]: At program point L10135-1(line 10135) the Hoare annotation is: false [2022-11-21 16:33:23,788 INFO L899 garLoopResultBuilder]: For program point L10164-3(line 10164) no Hoare annotation was computed. [2022-11-21 16:33:23,788 INFO L899 garLoopResultBuilder]: For program point L10160(lines 10160 10174) no Hoare annotation was computed. [2022-11-21 16:33:23,788 INFO L899 garLoopResultBuilder]: For program point L10160-1(lines 10160 10174) no Hoare annotation was computed. [2022-11-21 16:33:23,788 INFO L895 garLoopResultBuilder]: At program point L10173(line 10173) the Hoare annotation is: false [2022-11-21 16:33:23,788 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-11-21 16:33:23,788 INFO L899 garLoopResultBuilder]: For program point L10173-1(line 10173) no Hoare annotation was computed. [2022-11-21 16:33:23,789 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,789 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0))) (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= .cse0 (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= .cse0 |ULTIMATE.start_ensure_allocated_hash_table_#t~mem549#1|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) [2022-11-21 16:33:23,789 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,789 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,790 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-11-21 16:33:23,790 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-21 16:33:23,790 INFO L899 garLoopResultBuilder]: For program point L10132(lines 10132 10175) no Hoare annotation was computed. [2022-11-21 16:33:23,790 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-11-21 16:33:23,790 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-11-21 16:33:23,791 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-11-21 16:33:23,791 INFO L899 garLoopResultBuilder]: For program point L10161(lines 10161 10167) no Hoare annotation was computed. [2022-11-21 16:33:23,791 INFO L899 garLoopResultBuilder]: For program point L10161-2(lines 10160 10172) no Hoare annotation was computed. [2022-11-21 16:33:23,791 INFO L895 garLoopResultBuilder]: At program point L10141(line 10141) the Hoare annotation is: false [2022-11-21 16:33:23,791 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:33:23,792 INFO L899 garLoopResultBuilder]: For program point L10141-1(line 10141) no Hoare annotation was computed. [2022-11-21 16:33:23,792 INFO L895 garLoopResultBuilder]: At program point L10170(line 10170) the Hoare annotation is: false [2022-11-21 16:33:23,792 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-11-21 16:33:23,792 INFO L895 garLoopResultBuilder]: At program point L10162(line 10162) the Hoare annotation is: false [2022-11-21 16:33:23,792 INFO L895 garLoopResultBuilder]: At program point L10170-1(line 10170) the Hoare annotation is: false [2022-11-21 16:33:23,793 INFO L899 garLoopResultBuilder]: For program point L10170-2(line 10170) no Hoare annotation was computed. [2022-11-21 16:33:23,793 INFO L895 garLoopResultBuilder]: At program point L10154(lines 10154 10158) the Hoare annotation is: false [2022-11-21 16:33:23,793 INFO L899 garLoopResultBuilder]: For program point L10162-1(line 10162) no Hoare annotation was computed. [2022-11-21 16:33:23,793 INFO L899 garLoopResultBuilder]: For program point L10154-1(lines 10154 10158) no Hoare annotation was computed. [2022-11-21 16:33:23,793 INFO L895 garLoopResultBuilder]: At program point L10138(line 10138) the Hoare annotation is: false [2022-11-21 16:33:23,794 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-11-21 16:33:23,794 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-11-21 16:33:23,794 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-11-21 16:33:23,794 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-11-21 16:33:23,794 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-11-21 16:33:23,794 INFO L899 garLoopResultBuilder]: For program point L10138-1(line 10138) no Hoare annotation was computed. [2022-11-21 16:33:23,795 INFO L899 garLoopResultBuilder]: For program point L10159-2(line 10159) no Hoare annotation was computed. [2022-11-21 16:33:23,795 INFO L895 garLoopResultBuilder]: At program point L10159(line 10159) the Hoare annotation is: false [2022-11-21 16:33:23,795 INFO L895 garLoopResultBuilder]: At program point L10159-1(line 10159) the Hoare annotation is: false [2022-11-21 16:33:23,795 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-21 16:33:23,795 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-21 16:33:23,796 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-21 16:33:23,796 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-21 16:33:23,796 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-21 16:33:23,796 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-21 16:33:23,801 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:33:23,803 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:33:23,817 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,819 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,820 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,821 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,832 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,833 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,834 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:23,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,837 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,838 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,838 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:23,838 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,839 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:23,839 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,839 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:23,839 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:23,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:33:23 BoogieIcfgContainer [2022-11-21 16:33:23,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:33:23,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:33:23,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:33:23,843 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:33:23,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:21:41" (3/4) ... [2022-11-21 16:33:23,847 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:33:23,854 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure uninterpreted_equals [2022-11-21 16:33:23,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-21 16:33:23,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_equals [2022-11-21 16:33:23,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_hasher [2022-11-21 16:33:23,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-11-21 16:33:23,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-21 16:33:23,855 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-11-21 16:33:23,856 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-11-21 16:33:23,856 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_calloc [2022-11-21 16:33:23,856 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_update_template_size [2022-11-21 16:33:23,856 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-11-21 16:33:23,856 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_keys_eq [2022-11-21 16:33:23,856 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_for [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_create [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-11-21 16:33:23,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_safe_eq_check [2022-11-21 16:33:23,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_alloc_state [2022-11-21 16:33:23,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_emplace_item [2022-11-21 16:33:23,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s_find_entry [2022-11-21 16:33:23,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 16:33:23,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-11-21 16:33:23,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-21 16:33:23,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-11-21 16:33:23,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-11-21 16:33:23,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-11-21 16:33:23,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-21 16:33:23,878 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 256 nodes and edges [2022-11-21 16:33:23,880 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2022-11-21 16:33:23,882 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2022-11-21 16:33:23,884 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-21 16:33:23,886 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-21 16:33:23,888 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 16:33:23,890 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 16:33:23,892 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:33:23,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || ((((((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && r == r) && tl_last_error == \old(tl_last_error)) && \old(a) == a) && \old(b) == b) && \result == 0) && \old(\valid) == \valid) && r == r)) || ((((((((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && r == r) && \old(a) == a) && \result + 1 <= 0) && \old(b) == b) && \old(\valid) == \valid) && r == r) [2022-11-21 16:33:23,930 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || (((((((\old(b) == b && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && r == r) && r == r) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && \old(a) == a)) || (((((((\old(b) == b && r == r) && r == r) && \result + 1 <= 0) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || tl_last_error == \old(tl_last_error))) && \old(\valid) == \valid) && \old(a) == a) [2022-11-21 16:33:24,540 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:33:24,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:33:24,541 INFO L158 Benchmark]: Toolchain (without parser) took 710338.06ms. Allocated memory was 165.7MB in the beginning and 633.3MB in the end (delta: 467.7MB). Free memory was 130.4MB in the beginning and 499.6MB in the end (delta: -369.2MB). Peak memory consumption was 443.3MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,542 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:33:24,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4186.21ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 130.4MB in the beginning and 102.1MB in the end (delta: 28.2MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 263.94ms. Allocated memory is still 207.6MB. Free memory was 102.1MB in the beginning and 87.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,543 INFO L158 Benchmark]: Boogie Preprocessor took 190.13ms. Allocated memory is still 207.6MB. Free memory was 87.4MB in the beginning and 77.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,543 INFO L158 Benchmark]: RCFGBuilder took 2673.92ms. Allocated memory was 207.6MB in the beginning and 289.4MB in the end (delta: 81.8MB). Free memory was 77.0MB in the beginning and 196.4MB in the end (delta: -119.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,544 INFO L158 Benchmark]: TraceAbstraction took 702316.89ms. Allocated memory was 289.4MB in the beginning and 633.3MB in the end (delta: 343.9MB). Free memory was 195.3MB in the beginning and 250.4MB in the end (delta: -55.1MB). Peak memory consumption was 287.8MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,544 INFO L158 Benchmark]: Witness Printer took 698.60ms. Allocated memory is still 633.3MB. Free memory was 250.4MB in the beginning and 499.6MB in the end (delta: -249.2MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2022-11-21 16:33:24,546 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.27ms. Allocated memory is still 130.0MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4186.21ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 130.4MB in the beginning and 102.1MB in the end (delta: 28.2MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 263.94ms. Allocated memory is still 207.6MB. Free memory was 102.1MB in the beginning and 87.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 190.13ms. Allocated memory is still 207.6MB. Free memory was 87.4MB in the beginning and 77.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2673.92ms. Allocated memory was 207.6MB in the beginning and 289.4MB in the end (delta: 81.8MB). Free memory was 77.0MB in the beginning and 196.4MB in the end (delta: -119.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 702316.89ms. Allocated memory was 289.4MB in the beginning and 633.3MB in the end (delta: 343.9MB). Free memory was 195.3MB in the beginning and 250.4MB in the end (delta: -55.1MB). Peak memory consumption was 287.8MB. Max. memory is 16.1GB. * Witness Printer took 698.60ms. Allocated memory is still 633.3MB. Free memory was 250.4MB in the beginning and 499.6MB in the end (delta: -249.2MB). Peak memory consumption was 93.7MB. 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_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 347 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 702.2s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 118.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 7692 SdHoareTripleChecker+Valid, 104.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6967 mSDsluCounter, 32215 SdHoareTripleChecker+Invalid, 98.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 457 IncrementalHoareTripleChecker+Unchecked, 26676 mSDsCounter, 3672 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35177 IncrementalHoareTripleChecker+Invalid, 39320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3672 mSolverCounterUnsat, 5539 mSDtfsCounter, 35177 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2365 GetRequests, 2042 SyntacticMatches, 9 SemanticMatches, 314 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=17, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 1340 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 2936 PreInvPairs, 2967 NumberOfFragments, 1178 HoareAnnotationTreeSize, 2936 FomulaSimplifications, 1323 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 134 FomulaSimplificationsInter, 500 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 519.3s SatisfiabilityAnalysisTime, 54.6s InterpolantComputationTime, 3659 NumberOfCodeBlocks, 3659 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3690 ConstructedInterpolants, 52 QuantifiedInterpolants, 7956 SizeOfPredicates, 70 NumberOfNonLiveVariables, 18916 ConjunctsInSsa, 555 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 4294/4352 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: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9448]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9502]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2022-11-21 16:33:24,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,564 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,565 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,566 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,567 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:24,567 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:24,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,570 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,570 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,571 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:24,571 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || ((((((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && r == r) && tl_last_error == \old(tl_last_error)) && \old(a) == a) && \old(b) == b) && \result == 0) && \old(\valid) == \valid) && r == r)) || ((((((((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && r == r) && \old(a) == a) && \result + 1 <= 0) && \old(b) == b) && \old(\valid) == \valid) && r == r) - InvariantResult [Line: 2541]: Loop Invariant [2022-11-21 16:33:24,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,574 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,574 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,574 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,575 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,575 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,575 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:24,575 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:24,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7,QUANTIFIED] [2022-11-21 16:33:24,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,577 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3049,QUANTIFIED] [2022-11-21 16:33:24,578 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,578 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_78,QUANTIFIED] [2022-11-21 16:33:24,578 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,578 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:33:24,579 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:33:24,579 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7 : int :: !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7) || !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_7] == 1)) || (((((((\old(b) == b && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && r == r) && r == r) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && \old(a) == a)) || (((((((\old(b) == b && r == r) && r == r) && \result + 1 <= 0) && (\exists v_ArrVal_3049 : int, v___CPROVER_overflow_mult_~#c~1.base_78 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78 := v_ArrVal_3049] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_78] == 0)) && ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || tl_last_error == \old(tl_last_error))) && \old(\valid) == \valid) && \old(a) == a) - InvariantResult [Line: 9433]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9437]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 16:33:24,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ea6d300-9a19-4600-b487-cf46fa528168/bin/uautomizer-vX5HgA9Q3a/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