./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 38b53e6a 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_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/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_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 17:12:01,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:12:01,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:12:01,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:12:01,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:12:01,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:12:01,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:12:01,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:12:01,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:12:01,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:12:01,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:12:01,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:12:01,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:12:01,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:12:01,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:12:01,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:12:01,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:12:01,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:12:01,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:12:01,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:12:01,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:12:01,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:12:01,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:12:01,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:12:01,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:12:01,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:12:01,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:12:01,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:12:01,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:12:01,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:12:01,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:12:01,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:12:01,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:12:01,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:12:01,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:12:01,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:12:01,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:12:01,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:12:01,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:12:01,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:12:01,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:12:01,199 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 17:12:01,240 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:12:01,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:12:01,241 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:12:01,241 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:12:01,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:12:01,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:12:01,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:12:01,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:12:01,244 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:12:01,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:12:01,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:12:01,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:12:01,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:12:01,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:12:01,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:12:01,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:12:01,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:12:01,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:12:01,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:12:01,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:12:01,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:12:01,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:01,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:12:01,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:12:01,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:12:01,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:12:01,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:12:01,250 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:12:01,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:12:01,251 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:12:01,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:12:01,251 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/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_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R 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-25 17:12:01,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:12:01,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:12:01,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:12:01,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:12:01,602 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:12:01,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-25 17:12:05,372 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:12:06,254 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:12:06,254 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-25 17:12:06,305 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data/4dbb06719/a6b61d7f21164689bee79fb837f611b3/FLAG6db7c1c83 [2022-11-25 17:12:06,336 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data/4dbb06719/a6b61d7f21164689bee79fb837f611b3 [2022-11-25 17:12:06,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:12:06,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:12:06,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:06,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:12:06,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:12:06,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:06" (1/1) ... [2022-11-25 17:12:06,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42afd638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:06, skipping insertion in model container [2022-11-25 17:12:06,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:06" (1/1) ... [2022-11-25 17:12:06,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:12:06,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:12:07,009 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-25 17:12:07,026 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-25 17:12:08,888 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,890 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,891 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,896 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,899 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,916 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,917 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,919 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:08,920 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:09,093 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:09,094 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:09,097 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:09,116 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:12:09,145 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:12:09,146 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:12:09,778 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:12:09,781 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:12:09,784 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:12:09,786 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:12:09,789 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:12:09,795 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:12:09,798 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:12:09,802 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:12:09,807 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:12:09,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:12:09,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:12:10,091 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:12:10,117 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:10,140 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:12:10,153 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:10,207 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,208 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,649 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,650 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,688 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,690 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,700 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,700 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,720 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,722 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,723 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,723 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,724 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,724 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,725 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:10,863 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:12:10,891 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-25 17:12:10,899 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-25 17:12:10,961 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,963 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,967 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,968 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,969 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,976 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,977 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,978 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:10,979 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,050 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:11,051 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:11,052 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:11,055 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:12:11,066 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:12:11,066 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:12:11,101 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:12:11,102 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:12:11,103 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:12:11,104 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:12:11,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:12:11,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:12:11,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:12:11,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:12:11,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:12:11,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:12:11,112 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:12:11,141 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:12:11,159 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:11,170 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:12:11,177 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:11,216 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,216 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,300 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,301 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,311 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,312 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,318 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,318 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,330 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,331 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,333 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,333 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,334 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,336 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,336 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:11,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:11,794 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:12:11,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11 WrapperNode [2022-11-25 17:12:11,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:11,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:12:11,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:12:11,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:12:11,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,123 INFO L138 Inliner]: procedures = 768, calls = 3252, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 336 [2022-11-25 17:12:12,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:12:12,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:12:12,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:12:12,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:12:12,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,184 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:12:12,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:12:12,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:12:12,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:12:12,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (1/1) ... [2022-11-25 17:12:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:12:12,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:12:12,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:12:12,339 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 17:12:12,339 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 17:12:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:12:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 17:12:12,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 17:12:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:12:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:12:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:12:12,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:12:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 17:12:12,342 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 17:12:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:12:12,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:12:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:12:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 17:12:12,343 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 17:12:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-11-25 17:12:12,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-11-25 17:12:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-11-25 17:12:12,359 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-11-25 17:12:12,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:12:12,821 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:12:12,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:12:13,241 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-11-25 17:12:13,260 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:12:13,269 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:12:13,270 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:12:13,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:13 BoogieIcfgContainer [2022-11-25 17:12:13,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:12:13,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:12:13,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:12:13,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:12:13,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:12:06" (1/3) ... [2022-11-25 17:12:13,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161fb8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:12:13, skipping insertion in model container [2022-11-25 17:12:13,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:11" (2/3) ... [2022-11-25 17:12:13,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161fb8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:12:13, skipping insertion in model container [2022-11-25 17:12:13,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:13" (3/3) ... [2022-11-25 17:12:13,285 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-11-25 17:12:13,309 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:12:13,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:12:13,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:12:13,384 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;@6d198324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:12:13,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:12:13,391 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-25 17:12:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 17:12:13,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:13,410 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-25 17:12:13,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-11-25 17:12:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:13,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830895311] [2022-11-25 17:12:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:12:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 17:12:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:12:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:12:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:14,543 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-25 17:12:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:14,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830895311] [2022-11-25 17:12:14,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830895311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:14,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:14,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:12:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235616234] [2022-11-25 17:12:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:14,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:12:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:14,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:12:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:12:14,640 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-25 17:12:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:14,898 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-11-25 17:12:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:12:14,901 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-25 17:12:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:14,912 INFO L225 Difference]: With dead ends: 139 [2022-11-25 17:12:14,913 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 17:12:14,917 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-25 17:12:14,922 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-25 17:12:14,923 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-25 17:12:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 17:12:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 17:12:14,977 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-25 17:12:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-25 17:12:14,983 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-11-25 17:12:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:14,985 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-25 17:12:14,986 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-25 17:12:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-25 17:12:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 17:12:14,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:14,991 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-25 17:12:14,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:12:14,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-11-25 17:12:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784644095] [2022-11-25 17:12:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:12:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 17:12:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:12:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:12:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:16,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:12:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:17,110 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-25 17:12:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:17,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784644095] [2022-11-25 17:12:17,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784644095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:17,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:17,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 17:12:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943763499] [2022-11-25 17:12:17,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:12:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:12:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:12:17,124 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-25 17:12:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:17,808 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-11-25 17:12:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:12:17,809 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-25 17:12:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:17,811 INFO L225 Difference]: With dead ends: 89 [2022-11-25 17:12:17,811 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 17:12:17,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:12:17,813 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:17,814 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.5s Time] [2022-11-25 17:12:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 17:12:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 17:12:17,826 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-25 17:12:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-25 17:12:17,828 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-11-25 17:12:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:17,829 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-25 17:12:17,830 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-25 17:12:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-25 17:12:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 17:12:17,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:17,832 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-25 17:12:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:12:17,833 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-11-25 17:12:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:17,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530286694] [2022-11-25 17:12:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:12:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 17:12:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:12:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:12:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:12:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:12:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:19,735 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-25 17:12:19,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530286694] [2022-11-25 17:12:19,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530286694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:19,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:19,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 17:12:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931890758] [2022-11-25 17:12:19,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 17:12:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:19,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 17:12:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-11-25 17:12:19,750 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-25 17:12:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:20,757 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-11-25 17:12:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:12:20,758 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-25 17:12:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:20,761 INFO L225 Difference]: With dead ends: 94 [2022-11-25 17:12:20,761 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 17:12:20,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:12:20,763 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-25 17:12:20,763 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-25 17:12:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 17:12:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-11-25 17:12:20,781 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-25 17:12:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-11-25 17:12:20,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-11-25 17:12:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:20,787 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-11-25 17:12:20,787 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-25 17:12:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-11-25 17:12:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 17:12:20,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:20,796 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-25 17:12:20,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:12:20,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-11-25 17:12:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125522588] [2022-11-25 17:12:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:21,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:12:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 17:12:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:12:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:12:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:12:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:12:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 17:12:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:22,411 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-25 17:12:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125522588] [2022-11-25 17:12:22,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125522588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:22,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:22,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 17:12:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433614369] [2022-11-25 17:12:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:12:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:22,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:12:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:12:22,421 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-25 17:12:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:23,231 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-11-25 17:12:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:12:23,232 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-25 17:12:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:23,238 INFO L225 Difference]: With dead ends: 98 [2022-11-25 17:12:23,238 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 17:12:23,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:12:23,240 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 51 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:23,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 439 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:12:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 17:12:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-25 17:12:23,270 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-25 17:12:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-25 17:12:23,272 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-11-25 17:12:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:23,272 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-25 17:12:23,273 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-25 17:12:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-25 17:12:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-25 17:12:23,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:23,277 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-25 17:12:23,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:12:23,278 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-11-25 17:12:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:23,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104173429] [2022-11-25 17:12:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:12:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:12:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 17:12:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:12:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:12:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:12:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:24,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:12:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:25,103 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-25 17:12:25,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:25,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104173429] [2022-11-25 17:12:25,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104173429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:25,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:25,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 17:12:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605793243] [2022-11-25 17:12:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:25,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 17:12:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 17:12:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:12:25,107 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-25 17:12:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:25,872 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-11-25 17:12:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:12:25,873 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-25 17:12:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:25,875 INFO L225 Difference]: With dead ends: 102 [2022-11-25 17:12:25,875 INFO L226 Difference]: Without dead ends: 100 [2022-11-25 17:12:25,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-11-25 17:12:25,877 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:25,877 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.6s Time] [2022-11-25 17:12:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-25 17:12:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-11-25 17:12:25,894 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-25 17:12:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-11-25 17:12:25,895 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-11-25 17:12:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:25,896 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-11-25 17:12:25,896 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-25 17:12:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-11-25 17:12:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-25 17:12:25,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:25,899 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-25 17:12:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:12:25,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-11-25 17:12:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:25,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169460929] [2022-11-25 17:12:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 17:12:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-25 17:12:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 17:12:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 17:12:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 17:12:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:12:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 17:12:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-25 17:12:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:27,872 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-25 17:12:27,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:27,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169460929] [2022-11-25 17:12:27,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169460929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:27,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:27,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 17:12:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841626162] [2022-11-25 17:12:27,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:27,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 17:12:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 17:12:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:12:27,878 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-25 17:12:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:28,540 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-11-25 17:12:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:12:28,541 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-25 17:12:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:28,545 INFO L225 Difference]: With dead ends: 100 [2022-11-25 17:12:28,545 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 17:12:28,546 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-25 17:12:28,546 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 37 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:28,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 392 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:12:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 17:12:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-25 17:12:28,560 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-25 17:12:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-25 17:12:28,561 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-11-25 17:12:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:28,562 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-25 17:12:28,563 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-25 17:12:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-25 17:12:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-25 17:12:28,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:28,565 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-25 17:12:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:12:28,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-11-25 17:12:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503628855] [2022-11-25 17:12:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:12:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 17:12:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 17:12:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 17:12:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 17:12:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 17:12:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 17:12:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 17:12:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 17:12:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 17:12:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 17:12:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 17:12:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:12:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:30,928 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-25 17:12:30,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:30,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503628855] [2022-11-25 17:12:30,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503628855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:30,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:30,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 17:12:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817738052] [2022-11-25 17:12:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:30,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 17:12:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 17:12:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:12:30,936 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-25 17:12:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:31,721 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-11-25 17:12:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:12:31,722 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-25 17:12:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:31,723 INFO L225 Difference]: With dead ends: 102 [2022-11-25 17:12:31,723 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 17:12:31,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:12:31,725 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 47 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:31,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 469 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:12:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 17:12:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 17:12:31,742 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-25 17:12:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-25 17:12:31,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-11-25 17:12:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:31,744 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-25 17:12:31,744 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-25 17:12:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-25 17:12:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 17:12:31,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:31,746 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-25 17:12:31,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:12:31,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-11-25 17:12:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:31,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954053612] [2022-11-25 17:12:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:12:32,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:12:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:12:32,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:12:32,595 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:12:32,596 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:12:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:12:32,604 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:32,611 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:12:32,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:12:32 BoogieIcfgContainer [2022-11-25 17:12:32,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:12:32,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:12:32,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:12:32,748 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:12:32,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:12:13" (3/4) ... [2022-11-25 17:12:32,754 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:12:32,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:12:32,755 INFO L158 Benchmark]: Toolchain (without parser) took 26408.98ms. Allocated memory was 172.0MB in the beginning and 484.4MB in the end (delta: 312.5MB). Free memory was 132.2MB in the beginning and 150.3MB in the end (delta: -18.1MB). Peak memory consumption was 293.2MB. Max. memory is 16.1GB. [2022-11-25 17:12:32,755 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 138.4MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:32,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 5448.55ms. Allocated memory was 172.0MB in the beginning and 220.2MB in the end (delta: 48.2MB). Free memory was 132.2MB in the beginning and 88.4MB in the end (delta: 43.8MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2022-11-25 17:12:32,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 324.98ms. Allocated memory is still 220.2MB. Free memory was 88.4MB in the beginning and 144.0MB in the end (delta: -55.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-11-25 17:12:32,756 INFO L158 Benchmark]: Boogie Preprocessor took 70.24ms. Allocated memory is still 220.2MB. Free memory was 144.0MB in the beginning and 139.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:12:32,757 INFO L158 Benchmark]: RCFGBuilder took 1078.25ms. Allocated memory is still 220.2MB. Free memory was 139.8MB in the beginning and 120.9MB in the end (delta: 18.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 17:12:32,757 INFO L158 Benchmark]: TraceAbstraction took 19470.99ms. Allocated memory was 220.2MB in the beginning and 484.4MB in the end (delta: 264.2MB). Free memory was 119.8MB in the beginning and 150.3MB in the end (delta: -30.5MB). Peak memory consumption was 234.8MB. Max. memory is 16.1GB. [2022-11-25 17:12:32,758 INFO L158 Benchmark]: Witness Printer took 6.51ms. Allocated memory is still 484.4MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:32,761 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.37ms. Allocated memory is still 138.4MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 5448.55ms. Allocated memory was 172.0MB in the beginning and 220.2MB in the end (delta: 48.2MB). Free memory was 132.2MB in the beginning and 88.4MB in the end (delta: 43.8MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 324.98ms. Allocated memory is still 220.2MB. Free memory was 88.4MB in the beginning and 144.0MB in the end (delta: -55.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.24ms. Allocated memory is still 220.2MB. Free memory was 144.0MB in the beginning and 139.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1078.25ms. Allocated memory is still 220.2MB. Free memory was 139.8MB in the beginning and 120.9MB in the end (delta: 18.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19470.99ms. Allocated memory was 220.2MB in the beginning and 484.4MB in the end (delta: 264.2MB). Free memory was 119.8MB in the beginning and 150.3MB in the end (delta: -30.5MB). Peak memory consumption was 234.8MB. Max. memory is 16.1GB. * Witness Printer took 6.51ms. Allocated memory is still 484.4MB. Free memory is still 150.3MB. 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: 19.3s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 3116 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2701 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3464 IncrementalHoareTripleChecker+Invalid, 3693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 415 mSDtfsCounter, 3464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 95, 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.3s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 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-25 17:12:32,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/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 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_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/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_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 17:12:35,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:12:35,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:12:35,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:12:35,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:12:35,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:12:35,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:12:35,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:12:35,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:12:35,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:12:35,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:12:35,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:12:35,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:12:35,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:12:35,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:12:35,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:12:35,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:12:35,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:12:35,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:12:35,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:12:35,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:12:36,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:12:36,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:12:36,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:12:36,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:12:36,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:12:36,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:12:36,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:12:36,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:12:36,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:12:36,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:12:36,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:12:36,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:12:36,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:12:36,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:12:36,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:12:36,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:12:36,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:12:36,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:12:36,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:12:36,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:12:36,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-25 17:12:36,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:12:36,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:12:36,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:12:36,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:12:36,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:12:36,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:12:36,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:12:36,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:12:36,088 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:12:36,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:12:36,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:12:36,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:12:36,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:12:36,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:12:36,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:12:36,090 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:12:36,092 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:12:36,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:12:36,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:12:36,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:12:36,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:12:36,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:12:36,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:12:36,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:12:36,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:12:36,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:12:36,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:12:36,097 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:12:36,097 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:12:36,098 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:12:36,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:12:36,099 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:12:36,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:12:36,100 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:12:36,100 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/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_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R 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-25 17:12:36,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:12:36,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:12:36,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:12:36,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:12:36,677 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:12:36,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-25 17:12:40,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:12:40,909 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:12:40,910 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-25 17:12:40,961 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data/1b35f5717/26899302d5e74f7394a0cd8ab683bb75/FLAG8318fa334 [2022-11-25 17:12:40,988 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/bin/uautomizer-ZsLfNo2U6R/data/1b35f5717/26899302d5e74f7394a0cd8ab683bb75 [2022-11-25 17:12:40,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:12:40,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:12:40,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:12:40,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:12:41,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:12:41,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:40" (1/1) ... [2022-11-25 17:12:41,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca4293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:12:41, skipping insertion in model container [2022-11-25 17:12:41,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:12:40" (1/1) ... [2022-11-25 17:12:41,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:12:41,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:12:41,602 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-25 17:12:41,617 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-25 17:12:43,288 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,294 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,298 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,299 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,326 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,327 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,329 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,329 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:43,482 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:43,483 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:43,484 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:43,491 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:12:43,493 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:12:43,494 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:12:44,015 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:12:44,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:12:44,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:12:44,020 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:12:44,021 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:12:44,023 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:12:44,024 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:12:44,024 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:12:44,025 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:12:44,026 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:12:44,027 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:12:44,300 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:12:44,366 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:44,413 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:12:44,427 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:44,466 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,467 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,869 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,870 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,906 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,907 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,918 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,918 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,937 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,938 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,940 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,940 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,941 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,942 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:44,942 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:45,118 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 17:12:45,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:12:45,189 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-25 17:12:45,190 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-25 17:12:45,245 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,246 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,250 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,251 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,251 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,258 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,259 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,260 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,261 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,271 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:45,272 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:45,272 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:45,275 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:12:45,285 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:12:45,286 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:12:45,312 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:12:45,313 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:12:45,314 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:12:45,316 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:12:45,317 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:12:45,318 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:12:45,319 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:12:45,321 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:12:45,322 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:12:45,323 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:12:45,324 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:12:45,376 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:12:45,388 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:45,401 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:12:45,408 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:45,446 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,449 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,555 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,556 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,562 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,563 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,565 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,566 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,573 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,574 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,574 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,575 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,575 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,576 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,576 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:12:45,624 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:12:45,638 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-25 17:12:45,638 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9c8da19-828c-409f-af56-f01ab9d12b1f/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-25 17:12:45,709 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,710 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,710 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,710 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,722 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,728 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,728 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,729 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,730 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,737 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:45,754 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:45,755 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 17:12:45,760 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 17:12:45,761 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 17:12:45,762 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 17:12:45,820 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 17:12:45,822 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 17:12:45,822 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 17:12:45,823 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 17:12:45,824 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 17:12:45,825 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 17:12:45,825 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 17:12:45,826 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 17:12:45,826 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 17:12:45,827 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 17:12:45,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 17:12:45,868 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 17:12:45,891 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:45,903 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 17:12:45,908 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 17:12:45,929 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:45,929 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,066 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,067 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,075 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,075 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,078 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,078 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 17:12:46,081 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4773) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.countNumberOfPrimitiveElementInType(CTranslationUtil.java:560) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.countNumberOfPrimitiveElementInType(CTranslationUtil.java:553) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.useConstantArrayForOnHeapDefaultInit(InitializationHandler.java:1052) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:261) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2963) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2172) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1148) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1094) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1496) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:289) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2395) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:270) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:244) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:206) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 17:12:46,091 INFO L158 Benchmark]: Toolchain (without parser) took 5095.89ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 63.0MB in the beginning and 60.2MB in the end (delta: 2.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2022-11-25 17:12:46,092 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 62.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:12:46,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 5093.40ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 62.7MB in the beginning and 60.2MB in the end (delta: 2.5MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2022-11-25 17:12:46,098 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 62.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 5093.40ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 62.7MB in the beginning and 60.2MB in the end (delta: 2.5MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4773) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range