./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro --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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- 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-8393723 [2022-11-18 20:08:42,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:08:42,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:08:42,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:08:42,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:08:42,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:08:42,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:08:42,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:08:42,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:08:42,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:08:42,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:08:42,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:08:42,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:08:42,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:08:42,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:08:42,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:08:42,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:08:42,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:08:42,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:08:42,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:08:42,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:08:42,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:08:42,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:08:42,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:08:42,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:08:42,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:08:42,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:08:42,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:08:42,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:08:42,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:08:42,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:08:42,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:08:42,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:08:42,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:08:42,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:08:42,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:08:42,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:08:42,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:08:42,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:08:42,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:08:42,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:08:42,658 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:08:42,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:08:42,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:08:42,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:08:42,679 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:08:42,680 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:08:42,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:08:42,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:08:42,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:08:42,681 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:08:42,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:08:42,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:08:42,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:08:42,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:08:42,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:08:42,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:08:42,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:08:42,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:08:42,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:08:42,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:08:42,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:08:42,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:08:42,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:08:42,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:08:42,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:08:42,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:08:42,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:08:42,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:08:42,685 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:08:42,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:08:42,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:08:42,685 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2022-11-18 20:08:43,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:08:43,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:08:43,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:08:43,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:08:43,043 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:08:43,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-18 20:08:43,131 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/a073c9d74/a864d4c9c2014f7a9d67d4fc409f704a/FLAG0241722f4 [2022-11-18 20:08:44,149 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:08:44,150 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-18 20:08:44,200 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/a073c9d74/a864d4c9c2014f7a9d67d4fc409f704a/FLAG0241722f4 [2022-11-18 20:08:44,555 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/a073c9d74/a864d4c9c2014f7a9d67d4fc409f704a [2022-11-18 20:08:44,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:08:44,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:08:44,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:08:44,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:08:44,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:08:44,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:08:44" (1/1) ... [2022-11-18 20:08:44,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2971c3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:44, skipping insertion in model container [2022-11-18 20:08:44,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:08:44" (1/1) ... [2022-11-18 20:08:44,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:08:44,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:08:45,105 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-18 20:08:45,114 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-18 20:08:46,228 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,235 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,236 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,236 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,238 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,252 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,253 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,255 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,256 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:46,842 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:08:46,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:08:46,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:08:46,848 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:08:46,856 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:08:46,857 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:08:46,861 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:08:46,864 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:08:46,865 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:08:46,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:08:47,089 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:08:47,204 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,205 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,640 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,641 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,665 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,668 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,676 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,677 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,698 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,700 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,701 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,702 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,702 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,705 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,705 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:08:47,854 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:08:47,884 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-18 20:08:47,884 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-18 20:08:47,943 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,943 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,947 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,947 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,948 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,956 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,956 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,957 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,958 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:47,994 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:08:47,995 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:08:47,996 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:08:47,996 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:08:47,997 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:08:47,998 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:08:47,998 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:08:47,999 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:08:47,999 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:08:48,000 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:08:48,019 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:08:48,070 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,072 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,189 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,190 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,214 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,215 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,220 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,220 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,231 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,232 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,233 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,233 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,233 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,234 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,234 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:08:48,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:08:48,631 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:08:48,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48 WrapperNode [2022-11-18 20:08:48,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:08:48,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:08:48,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:08:48,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:08:48,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,835 INFO L138 Inliner]: procedures = 768, calls = 3252, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 336 [2022-11-18 20:08:48,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:08:48,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:08:48,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:08:48,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:08:48,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,875 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:08:48,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:08:48,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:08:48,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:08:48,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (1/1) ... [2022-11-18 20:08:48,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:08:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:48,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:08:48,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:08:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-18 20:08:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-18 20:08:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:08:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:08:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:08:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:08:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:08:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:08:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:08:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-18 20:08:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-18 20:08:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:08:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:08:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:08:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:08:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:08:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-11-18 20:08:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-11-18 20:08:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-11-18 20:08:49,031 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-11-18 20:08:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:08:49,372 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:08:49,375 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:08:49,818 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-11-18 20:08:49,848 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:08:49,857 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:08:49,858 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:08:49,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:49 BoogieIcfgContainer [2022-11-18 20:08:49,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:08:49,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:08:49,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:08:49,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:08:49,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:08:44" (1/3) ... [2022-11-18 20:08:49,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49854e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:08:49, skipping insertion in model container [2022-11-18 20:08:49,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:48" (2/3) ... [2022-11-18 20:08:49,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49854e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:08:49, skipping insertion in model container [2022-11-18 20:08:49,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:49" (3/3) ... [2022-11-18 20:08:49,871 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-11-18 20:08:49,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:08:49,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:08:49,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:08:49,992 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;@3e463d18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:08:49,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:08:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-18 20:08:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-18 20:08:50,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:50,015 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:50,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:08:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-11-18 20:08:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:50,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313348303] [2022-11-18 20:08:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:08:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:08:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:08:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:08:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:08:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:08:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 20:08:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:08:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:08:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-18 20:08:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313348303] [2022-11-18 20:08:50,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313348303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:50,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:50,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:08:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93834055] [2022-11-18 20:08:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:50,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:08:50,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:08:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:08:50,887 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 20:08:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:51,103 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-11-18 20:08:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:08:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-11-18 20:08:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:51,117 INFO L225 Difference]: With dead ends: 139 [2022-11-18 20:08:51,118 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:08:51,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:08:51,129 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:51,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:08:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:08:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:08:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:08:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-18 20:08:51,192 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-11-18 20:08:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:51,194 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-18 20:08:51,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-18 20:08:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-18 20:08:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:08:51,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:51,202 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:51,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:08:51,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:08:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-11-18 20:08:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:51,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736410086] [2022-11-18 20:08:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:08:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:08:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:08:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:08:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:08:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:08:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 20:08:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:08:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:08:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:08:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 20:08:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:52,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736410086] [2022-11-18 20:08:52,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736410086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:52,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:52,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:08:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703333952] [2022-11-18 20:08:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:52,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:08:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:08:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:08:52,639 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-18 20:08:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:53,192 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-11-18 20:08:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:08:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2022-11-18 20:08:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:53,195 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:08:53,195 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:08:53,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:08:53,197 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:53,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 396 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:08:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:08:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:08:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:08:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-18 20:08:53,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-11-18 20:08:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:53,213 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-18 20:08:53,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-18 20:08:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-18 20:08:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-18 20:08:53,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:53,215 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:08:53,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:08:53,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:08:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-11-18 20:08:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063152984] [2022-11-18 20:08:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:08:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:08:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:08:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:08:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:08:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:08:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 20:08:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:08:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:08:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:08:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:08:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-18 20:08:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:54,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063152984] [2022-11-18 20:08:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063152984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:54,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:54,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-18 20:08:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239439276] [2022-11-18 20:08:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:54,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:08:54,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:08:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:08:54,794 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-18 20:08:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:55,721 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-11-18 20:08:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:08:55,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-11-18 20:08:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:55,724 INFO L225 Difference]: With dead ends: 94 [2022-11-18 20:08:55,724 INFO L226 Difference]: Without dead ends: 92 [2022-11-18 20:08:55,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:08:55,726 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 62 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:55,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 519 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:08:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-18 20:08:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-11-18 20:08:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-18 20:08:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-11-18 20:08:55,757 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-11-18 20:08:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:55,758 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-11-18 20:08:55,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-18 20:08:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-11-18 20:08:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-18 20:08:55,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:55,770 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:08:55,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:08:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-11-18 20:08:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:55,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250922358] [2022-11-18 20:08:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:08:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:08:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:08:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:08:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:08:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:08:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 20:08:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:08:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:08:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:08:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:08:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-18 20:08:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-18 20:08:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250922358] [2022-11-18 20:08:57,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250922358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:57,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:57,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 20:08:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291321750] [2022-11-18 20:08:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:57,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:08:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:08:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:08:57,181 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-18 20:08:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:57,843 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-11-18 20:08:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:08:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2022-11-18 20:08:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:57,851 INFO L225 Difference]: With dead ends: 98 [2022-11-18 20:08:57,851 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:08:57,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:08:57,853 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 58 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:57,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 441 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:08:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:08:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-18 20:08:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-18 20:08:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-18 20:08:57,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-11-18 20:08:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-18 20:08:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-18 20:08:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-18 20:08:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-18 20:08:57,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:57,891 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:57,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:08:57,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:08:57,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-11-18 20:08:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:57,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801961000] [2022-11-18 20:08:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:08:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:08:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:08:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:08:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:08:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:08:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:08:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:08:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:08:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:08:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:08:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:08:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:08:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:08:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:08:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:08:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-18 20:08:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:59,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801961000] [2022-11-18 20:08:59,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801961000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:59,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:59,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 20:08:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341911766] [2022-11-18 20:08:59,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:59,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:08:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:08:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:08:59,363 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 20:08:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:59,981 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-11-18 20:08:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:08:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2022-11-18 20:08:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:59,984 INFO L225 Difference]: With dead ends: 102 [2022-11-18 20:08:59,984 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 20:08:59,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:08:59,986 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:59,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 802 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:08:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 20:08:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-11-18 20:08:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-18 20:09:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-11-18 20:09:00,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-11-18 20:09:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:00,001 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-11-18 20:09:00,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 20:09:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-11-18 20:09:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-18 20:09:00,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:00,003 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:00,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:09:00,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-11-18 20:09:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175137365] [2022-11-18 20:09:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:09:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:09:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:09:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:09:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:09:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:09:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:09:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:09:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:09:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:09:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:09:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:09:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-18 20:09:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:09:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:09:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:09:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:09:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:09:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:09:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-18 20:09:01,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:01,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175137365] [2022-11-18 20:09:01,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175137365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:01,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:01,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 20:09:01,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145492841] [2022-11-18 20:09:01,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:01,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:09:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:01,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:09:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:09:01,623 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-18 20:09:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:02,129 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-11-18 20:09:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:09:02,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2022-11-18 20:09:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:02,132 INFO L225 Difference]: With dead ends: 100 [2022-11-18 20:09:02,132 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:09:02,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:09:02,134 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:02,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 444 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:09:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:09:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-18 20:09:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:09:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-18 20:09:02,146 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-11-18 20:09:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:02,146 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-18 20:09:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-18 20:09:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-18 20:09:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:09:02,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:02,152 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 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] [2022-11-18 20:09:02,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:09:02,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-11-18 20:09:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:02,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125791558] [2022-11-18 20:09:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:09:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:09:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-18 20:09:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:09:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 20:09:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 20:09:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-18 20:09:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 20:09:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:09:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 20:09:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 20:09:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-18 20:09:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-18 20:09:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-18 20:09:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:09:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:09:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-18 20:09:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:03,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125791558] [2022-11-18 20:09:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125791558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:03,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:03,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 20:09:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702930380] [2022-11-18 20:09:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:09:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:09:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:09:03,995 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-18 20:09:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:04,670 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-11-18 20:09:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:09:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 100 [2022-11-18 20:09:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:04,672 INFO L225 Difference]: With dead ends: 102 [2022-11-18 20:09:04,672 INFO L226 Difference]: Without dead ends: 71 [2022-11-18 20:09:04,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:09:04,673 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:04,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 494 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:09:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-18 20:09:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-18 20:09:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:09:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-18 20:09:04,688 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-11-18 20:09:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:04,688 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-18 20:09:04,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-18 20:09:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-18 20:09:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-18 20:09:04,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:04,690 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:04,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:09:04,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-11-18 20:09:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:04,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644806430] [2022-11-18 20:09:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:09:05,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:09:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:09:05,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:09:05,440 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:09:05,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:09:05,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:09:05,447 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:05,454 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:09:05,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:09:05 BoogieIcfgContainer [2022-11-18 20:09:05,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:09:05,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:09:05,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:09:05,559 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:09:05,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:49" (3/4) ... [2022-11-18 20:09:05,562 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:09:05,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:09:05,563 INFO L158 Benchmark]: Toolchain (without parser) took 21000.48ms. Allocated memory was 127.9MB in the beginning and 413.1MB in the end (delta: 285.2MB). Free memory was 101.5MB in the beginning and 223.4MB in the end (delta: -121.8MB). Peak memory consumption was 162.9MB. Max. memory is 16.1GB. [2022-11-18 20:09:05,563 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:09:05,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4065.26ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 101.2MB in the beginning and 72.2MB in the end (delta: 29.0MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2022-11-18 20:09:05,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.80ms. Allocated memory is still 169.9MB. Free memory was 72.2MB in the beginning and 61.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:09:05,564 INFO L158 Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 169.9MB. Free memory was 61.7MB in the beginning and 57.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:09:05,565 INFO L158 Benchmark]: RCFGBuilder took 976.70ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 57.5MB in the beginning and 138.8MB in the end (delta: -81.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-11-18 20:09:05,565 INFO L158 Benchmark]: TraceAbstraction took 15694.44ms. Allocated memory was 237.0MB in the beginning and 413.1MB in the end (delta: 176.2MB). Free memory was 137.7MB in the beginning and 223.4MB in the end (delta: -85.6MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2022-11-18 20:09:05,565 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 413.1MB. Free memory is still 223.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:09:05,568 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.29ms. Allocated memory is still 127.9MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4065.26ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 101.2MB in the beginning and 72.2MB in the end (delta: 29.0MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 201.80ms. Allocated memory is still 169.9MB. Free memory was 72.2MB in the beginning and 61.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.19ms. Allocated memory is still 169.9MB. Free memory was 61.7MB in the beginning and 57.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 976.70ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 57.5MB in the beginning and 138.8MB in the end (delta: -81.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15694.44ms. Allocated memory was 237.0MB in the beginning and 413.1MB in the end (delta: 176.2MB). Free memory was 137.7MB in the beginning and 223.4MB in the end (delta: -85.6MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 413.1MB. Free memory is still 223.4MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-36893488147419103231, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-18446744073709551615, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str={-3:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str={-3:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] return rval; VAL [\result=1, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, nondet_uint64_t()=18446744073709551873, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=257, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=258, a={-2:0}, a={-2:0}, a[i]=-255, b={-3:0}, b={-3:0}, b[i]=0, i=257, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 3195 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2780 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 415 mSDtfsCounter, 3546 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:09:05,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro --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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- 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-8393723 [2022-11-18 20:09:07,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:09:07,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:09:07,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:09:07,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:09:07,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:09:07,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:09:07,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:09:07,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:09:07,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:09:07,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:09:07,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:09:07,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:09:07,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:09:07,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:09:07,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:09:07,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:09:07,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:09:07,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:09:07,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:09:07,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:09:07,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:09:07,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:09:07,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:09:08,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:09:08,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:09:08,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:09:08,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:09:08,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:09:08,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:09:08,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:09:08,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:09:08,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:09:08,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:09:08,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:09:08,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:09:08,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:09:08,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:09:08,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:09:08,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:09:08,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:09:08,013 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:09:08,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:09:08,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:09:08,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:09:08,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:09:08,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:09:08,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:09:08,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:09:08,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:09:08,041 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:09:08,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:09:08,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:09:08,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:09:08,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:09:08,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:09:08,042 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:09:08,042 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:09:08,043 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:09:08,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:09:08,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:09:08,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:09:08,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:09:08,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:09:08,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:09:08,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:09:08,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:09:08,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:09:08,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:09:08,045 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:09:08,045 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:09:08,046 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:09:08,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:09:08,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:09:08,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:09:08,046 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2022-11-18 20:09:08,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:09:08,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:09:08,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:09:08,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:09:08,457 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:09:08,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-18 20:09:08,545 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/3613caf34/f4b940dd97a0490cacca43b0a0745aac/FLAG8b1171bab [2022-11-18 20:09:09,544 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:09:09,545 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-18 20:09:09,587 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/3613caf34/f4b940dd97a0490cacca43b0a0745aac/FLAG8b1171bab [2022-11-18 20:09:09,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/data/3613caf34/f4b940dd97a0490cacca43b0a0745aac [2022-11-18 20:09:09,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:09:09,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:09:09,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:09:09,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:09:09,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:09:09,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:09:09" (1/1) ... [2022-11-18 20:09:09,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d392960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:09, skipping insertion in model container [2022-11-18 20:09:09,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:09:09" (1/1) ... [2022-11-18 20:09:09,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:09:09,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:09:10,073 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-18 20:09:10,083 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-18 20:09:11,644 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,647 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,649 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,650 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,652 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,665 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,673 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,679 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:11,680 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:09:12,282 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:09:12,283 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:09:12,285 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:09:12,287 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:09:12,288 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:09:12,289 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:09:12,290 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:09:12,291 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:09:12,291 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:09:12,497 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:09:12,590 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,591 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,891 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,892 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,915 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,915 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,930 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,930 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,950 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,951 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,954 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,955 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,956 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,957 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:12,957 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:13,130 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:09:13,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:09:13,216 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-18 20:09:13,216 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-18 20:09:13,277 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,278 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,278 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,278 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,279 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,284 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,285 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,285 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,286 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:09:13,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:09:13,336 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:09:13,336 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:09:13,337 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:09:13,337 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:09:13,338 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:09:13,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:09:13,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:09:13,339 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:09:13,358 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:09:13,441 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,442 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,556 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,556 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,565 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,568 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,570 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,571 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,580 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,581 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,582 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,582 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,583 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,583 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,585 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:13,681 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:09:13,705 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-18 20:09:13,711 WARN L234 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_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-18 20:09:13,770 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,770 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,770 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,771 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,771 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,779 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,780 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,780 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,782 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 20:09:13,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 20:09:13,815 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 20:09:13,816 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 20:09:13,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 20:09:13,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 20:09:13,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 20:09:13,819 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 20:09:13,819 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 20:09:13,820 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 20:09:13,839 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 20:09:13,886 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,886 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,969 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,970 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,980 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,981 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,983 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,983 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,991 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,991 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,992 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,992 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,993 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,993 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:13,993 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 20:09:14,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:14,529 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:09:14,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14 WrapperNode [2022-11-18 20:09:14,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:09:14,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:09:14,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:09:14,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:09:14,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,738 INFO L138 Inliner]: procedures = 788, calls = 3252, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 337 [2022-11-18 20:09:14,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:09:14,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:09:14,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:09:14,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:09:14,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,820 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:09:14,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:09:14,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:09:14,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:09:14,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (1/1) ... [2022-11-18 20:09:14,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:09:14,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:14,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:09:14,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:09:14,934 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-18 20:09:14,934 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-18 20:09:14,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:09:14,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:09:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:09:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:09:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:09:14,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:09:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-18 20:09:14,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-18 20:09:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 20:09:14,936 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 20:09:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:09:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-18 20:09:14,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:09:14,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:09:14,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:09:14,937 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-11-18 20:09:14,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-11-18 20:09:14,937 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-11-18 20:09:14,938 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-11-18 20:09:15,347 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:09:15,350 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:09:15,736 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-11-18 20:09:15,751 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:09:15,758 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:09:15,758 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:09:15,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:15 BoogieIcfgContainer [2022-11-18 20:09:15,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:09:15,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:09:15,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:09:15,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:09:15,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:09:09" (1/3) ... [2022-11-18 20:09:15,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d850d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:09:15, skipping insertion in model container [2022-11-18 20:09:15,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:14" (2/3) ... [2022-11-18 20:09:15,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d850d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:09:15, skipping insertion in model container [2022-11-18 20:09:15,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:15" (3/3) ... [2022-11-18 20:09:15,770 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-11-18 20:09:15,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:09:15,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:09:15,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:09:15,853 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;@33fd8bf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:09:15,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:09:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-18 20:09:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-18 20:09:15,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:15,869 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:15,870 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-11-18 20:09:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:15,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460041832] [2022-11-18 20:09:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:15,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:15,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:15,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:09:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:16,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:09:16,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-18 20:09:16,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:16,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:16,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460041832] [2022-11-18 20:09:16,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460041832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:16,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:16,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:09:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044081102] [2022-11-18 20:09:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:09:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:09:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:09:16,466 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-18 20:09:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:16,502 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-11-18 20:09:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:09:16,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2022-11-18 20:09:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:16,519 INFO L225 Difference]: With dead ends: 139 [2022-11-18 20:09:16,520 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:09:16,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-18 20:09:16,530 INFO L413 NwaCegarLoop]: 86 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, 86 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-18 20:09:16,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:09:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:09:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:09:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:09:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-18 20:09:16,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-11-18 20:09:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:16,586 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-18 20:09:16,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-18 20:09:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-18 20:09:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:09:16,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:16,590 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:16,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 20:09:16,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:16,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-11-18 20:09:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282685093] [2022-11-18 20:09:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:16,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:16,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:16,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:16,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:09:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:17,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:09:17,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 20:09:17,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:17,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:17,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282685093] [2022-11-18 20:09:17,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282685093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:17,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:17,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:09:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283865439] [2022-11-18 20:09:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:17,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:09:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:09:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:09:17,509 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-18 20:09:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:17,883 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-11-18 20:09:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:09:17,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2022-11-18 20:09:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:17,887 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:09:17,888 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:09:17,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:09:17,893 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:17,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 641 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:09:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:09:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:09:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:09:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-18 20:09:17,916 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-11-18 20:09:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:17,921 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-18 20:09:17,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-18 20:09:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-18 20:09:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-18 20:09:17,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:17,927 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:09:17,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:18,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:18,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-11-18 20:09:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:18,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974984279] [2022-11-18 20:09:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:18,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:18,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:18,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:18,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:09:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:18,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:09:18,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-18 20:09:18,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:18,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:18,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974984279] [2022-11-18 20:09:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974984279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:18,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:18,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 20:09:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115004815] [2022-11-18 20:09:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:18,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:09:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:09:18,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:09:18,752 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-18 20:09:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:19,311 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-11-18 20:09:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:09:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-11-18 20:09:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:19,315 INFO L225 Difference]: With dead ends: 94 [2022-11-18 20:09:19,315 INFO L226 Difference]: Without dead ends: 92 [2022-11-18 20:09:19,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:09:19,316 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 42 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:19,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 875 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:09:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-18 20:09:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-11-18 20:09:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-18 20:09:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-11-18 20:09:19,333 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-11-18 20:09:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:19,333 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-11-18 20:09:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-18 20:09:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-11-18 20:09:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-18 20:09:19,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:19,336 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:19,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:19,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:19,556 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-11-18 20:09:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601705676] [2022-11-18 20:09:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:19,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:19,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:09:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:19,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:09:19,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-18 20:09:20,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:20,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:20,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601705676] [2022-11-18 20:09:20,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601705676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:20,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:20,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:09:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413329968] [2022-11-18 20:09:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:20,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:09:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:09:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:09:20,292 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-18 20:09:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:20,692 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-11-18 20:09:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:09:20,694 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2022-11-18 20:09:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:20,695 INFO L225 Difference]: With dead ends: 98 [2022-11-18 20:09:20,696 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:09:20,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:09:20,697 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:20,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 841 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:09:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:09:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-18 20:09:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-18 20:09:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-18 20:09:20,726 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-11-18 20:09:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:20,729 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-18 20:09:20,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-18 20:09:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-18 20:09:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-18 20:09:20,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:20,740 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:20,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:20,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:20,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-11-18 20:09:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:20,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392505756] [2022-11-18 20:09:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:20,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:20,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:20,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:20,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 20:09:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:21,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:09:21,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-18 20:09:21,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:21,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392505756] [2022-11-18 20:09:21,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392505756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:21,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:21,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 20:09:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344443157] [2022-11-18 20:09:21,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:21,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:09:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:09:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:09:21,522 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 20:09:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:21,997 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-11-18 20:09:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:09:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2022-11-18 20:09:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:21,999 INFO L225 Difference]: With dead ends: 102 [2022-11-18 20:09:21,999 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 20:09:21,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:09:22,000 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:22,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1160 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:09:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 20:09:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-11-18 20:09:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-18 20:09:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-11-18 20:09:22,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-11-18 20:09:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:22,016 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-11-18 20:09:22,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-18 20:09:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-11-18 20:09:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-18 20:09:22,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:22,019 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:22,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:22,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:22,241 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-11-18 20:09:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077154825] [2022-11-18 20:09:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:22,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:22,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:22,244 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:22,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 20:09:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:22,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:09:22,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-18 20:09:22,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:22,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:22,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077154825] [2022-11-18 20:09:22,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077154825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:22,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:22,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 20:09:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595058846] [2022-11-18 20:09:22,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:22,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:09:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:09:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:09:22,908 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-18 20:09:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:23,266 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-11-18 20:09:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:09:23,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2022-11-18 20:09:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:23,270 INFO L225 Difference]: With dead ends: 100 [2022-11-18 20:09:23,270 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:09:23,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:09:23,271 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 27 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:23,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 739 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:09:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:09:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-18 20:09:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:09:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-18 20:09:23,289 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-11-18 20:09:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:23,290 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-18 20:09:23,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-18 20:09:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-18 20:09:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:09:23,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:23,292 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 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] [2022-11-18 20:09:23,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:23,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:23,493 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-11-18 20:09:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:23,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965541468] [2022-11-18 20:09:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:23,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:23,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:23,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:23,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 20:09:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:23,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:09:23,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:24,092 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 19 treesize of output 7 [2022-11-18 20:09:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-18 20:09:24,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:24,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:09:24,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965541468] [2022-11-18 20:09:24,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965541468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:24,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:24,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:09:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322267855] [2022-11-18 20:09:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:24,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:09:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:09:24,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:09:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:09:24,143 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:09:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:24,410 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-11-18 20:09:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:09:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 100 [2022-11-18 20:09:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:24,412 INFO L225 Difference]: With dead ends: 102 [2022-11-18 20:09:24,412 INFO L226 Difference]: Without dead ends: 71 [2022-11-18 20:09:24,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:09:24,413 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:24,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 537 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:09:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-18 20:09:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-18 20:09:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:09:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-18 20:09:24,427 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-11-18 20:09:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:24,428 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-18 20:09:24,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:09:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-18 20:09:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-18 20:09:24,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:24,430 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:24,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:24,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:09:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:24,649 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-11-18 20:09:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:09:24,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141552494] [2022-11-18 20:09:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:09:24,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:09:24,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 20:09:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:09:25,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:09:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:09:27,879 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 20:09:27,879 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:09:27,880 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:09:27,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:28,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:09:28,110 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:28,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:09:28,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:09:28 BoogieIcfgContainer [2022-11-18 20:09:28,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:09:28,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:09:28,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:09:28,200 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:09:28,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:15" (3/4) ... [2022-11-18 20:09:28,204 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:09:28,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:09:28,206 INFO L158 Benchmark]: Toolchain (without parser) took 18598.40ms. Allocated memory was 73.4MB in the beginning and 348.1MB in the end (delta: 274.7MB). Free memory was 45.5MB in the beginning and 196.6MB in the end (delta: -151.1MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2022-11-18 20:09:28,206 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 73.4MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:09:28,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4920.46ms. Allocated memory was 73.4MB in the beginning and 174.1MB in the end (delta: 100.7MB). Free memory was 45.3MB in the beginning and 95.4MB in the end (delta: -50.1MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2022-11-18 20:09:28,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 209.43ms. Allocated memory is still 174.1MB. Free memory was 95.4MB in the beginning and 84.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:09:28,207 INFO L158 Benchmark]: Boogie Preprocessor took 102.70ms. Allocated memory is still 174.1MB. Free memory was 84.1MB in the beginning and 78.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:09:28,208 INFO L158 Benchmark]: RCFGBuilder took 916.21ms. Allocated memory is still 174.1MB. Free memory was 78.7MB in the beginning and 68.9MB in the end (delta: 9.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-18 20:09:28,208 INFO L158 Benchmark]: TraceAbstraction took 12436.43ms. Allocated memory was 174.1MB in the beginning and 348.1MB in the end (delta: 174.1MB). Free memory was 67.8MB in the beginning and 196.6MB in the end (delta: -128.7MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2022-11-18 20:09:28,209 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 348.1MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:09:28,211 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.36ms. Allocated memory is still 73.4MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4920.46ms. Allocated memory was 73.4MB in the beginning and 174.1MB in the end (delta: 100.7MB). Free memory was 45.3MB in the beginning and 95.4MB in the end (delta: -50.1MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 209.43ms. Allocated memory is still 174.1MB. Free memory was 95.4MB in the beginning and 84.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.70ms. Allocated memory is still 174.1MB. Free memory was 84.1MB in the beginning and 78.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 916.21ms. Allocated memory is still 174.1MB. Free memory was 78.7MB in the beginning and 68.9MB in the end (delta: 9.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12436.43ms. Allocated memory was 174.1MB in the beginning and 348.1MB in the end (delta: 174.1MB). Free memory was 67.8MB in the beginning and 196.6MB in the end (delta: -128.7MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 348.1MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={12:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={12:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={12:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={12:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={12:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={7:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={7:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={7:0}, nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={12:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={7:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={7:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={12:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}, str={12:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}, str={7:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={12:0}, str={12:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={7:0}, str={7:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={12:0}, a={12:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] return rval; VAL [\result=1, a={12:0}, a={12:0}, b={7:0}, b={7:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1073750016, a={12:0}, a={12:0}, b={7:0}, b={7:0}, len=1073750016, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1073750016, a={12:0}, a={12:0}, b={7:0}, b={7:0}, len=1073750016, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=1073750016, a={12:0}, a={12:0}, b={7:0}, b={7:0}, len=1073750016, nondet_uint64_t()=1073741824, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1073750016, a={12:0}, a={12:0}, b={7:0}, b={7:0}, i=1073741824, len=1073750016, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=1073750016, a={12:0}, a={12:0}, a[i]=0, b={7:0}, b={7:0}, b[i]=48, i=1073741824, len=1073750016, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 4879 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4332 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1094 IncrementalHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 547 mSDtfsCounter, 1094 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1351 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3207 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:09:28,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_550f2d4c-8c2e-4cb3-98ea-dc7bbfe0c21a/bin/uautomizer-TMbwUNV5ro/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: UNKNOWN: Overapproximated counterexample