./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:18:25,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:18:25,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:18:25,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:18:25,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:18:25,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:18:25,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:18:25,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:18:25,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:18:25,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:18:25,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:18:25,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:18:25,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:18:25,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:18:25,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:18:25,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:18:25,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:18:25,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:18:25,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:18:25,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:18:25,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:18:25,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:18:25,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:18:25,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:18:25,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:18:25,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:18:25,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:18:25,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:18:25,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:18:25,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:18:25,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:18:25,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:18:25,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:18:25,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:18:25,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:18:25,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:18:25,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:18:25,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:18:25,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:18:25,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:18:25,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:18:25,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 03:18:25,211 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:18:25,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:18:25,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:18:25,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:18:25,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:18:25,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:18:25,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:18:25,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:18:25,215 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:18:25,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:18:25,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:18:25,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:18:25,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:18:25,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:18:25,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:18:25,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:18:25,217 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:18:25,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:18:25,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:18:25,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:18:25,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:18:25,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:18:25,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:18:25,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:18:25,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:18:25,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:18:25,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:18:25,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:18:25,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:18:25,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:18:25,220 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:18:25,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-12-16 03:18:25,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:18:25,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:18:25,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:18:25,501 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:18:25,502 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:18:25,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-16 03:18:25,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edefb2d7b/2401f9cdfd7c424eb8afeaa09fb9a6a9/FLAG5a7be41df [2021-12-16 03:18:26,355 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:18:26,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-16 03:18:26,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edefb2d7b/2401f9cdfd7c424eb8afeaa09fb9a6a9/FLAG5a7be41df [2021-12-16 03:18:26,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edefb2d7b/2401f9cdfd7c424eb8afeaa09fb9a6a9 [2021-12-16 03:18:26,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:18:26,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:18:26,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:18:26,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:18:26,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:18:26,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:18:26" (1/1) ... [2021-12-16 03:18:26,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505749ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:26, skipping insertion in model container [2021-12-16 03:18:26,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:18:26" (1/1) ... [2021-12-16 03:18:26,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:18:26,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:18:26,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-16 03:18:26,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-16 03:18:27,913 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,914 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,914 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,915 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,916 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,928 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,929 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,931 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:27,931 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,359 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:18:28,361 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:18:28,361 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:18:28,362 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:18:28,363 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:18:28,364 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:18:28,365 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:18:28,365 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:18:28,366 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:18:28,366 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:18:28,540 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:18:28,635 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,636 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,942 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,942 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,966 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,974 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:28,975 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,001 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,003 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,004 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,004 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,005 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,005 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,006 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:18:29,204 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:18:29,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-16 03:18:29,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-16 03:18:29,287 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,288 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,290 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,291 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,291 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,297 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,297 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,298 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,298 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,324 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:18:29,325 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:18:29,326 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:18:29,326 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:18:29,327 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:18:29,327 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:18:29,328 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:18:29,328 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:18:29,328 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:18:29,329 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:18:29,343 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:18:29,387 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,389 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,482 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,482 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,487 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,488 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,492 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,492 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,499 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,500 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,500 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,501 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,501 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,501 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,502 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:29,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:18:29,761 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:18:29,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29 WrapperNode [2021-12-16 03:18:29,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:18:29,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:18:29,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:18:29,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:18:29,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:29,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:29,946 INFO L137 Inliner]: procedures = 768, calls = 3253, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 337 [2021-12-16 03:18:29,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:18:29,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:18:29,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:18:29,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:18:29,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:29,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:29,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:29,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:29,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:30,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:30,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:30,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:18:30,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:18:30,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:18:30,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:18:30,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (1/1) ... [2021-12-16 03:18:30,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:18:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:18:30,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 03:18:30,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 03:18:30,117 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-16 03:18:30,118 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-16 03:18:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:18:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 03:18:30,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 03:18:30,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 03:18:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:18:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:18:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:18:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-16 03:18:30,119 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-16 03:18:30,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-16 03:18:30,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-16 03:18:30,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 03:18:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-16 03:18:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-16 03:18:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-16 03:18:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-16 03:18:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-16 03:18:30,121 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-16 03:18:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:18:30,382 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:18:30,383 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:18:30,613 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-16 03:18:30,624 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:18:30,630 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:18:30,631 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 03:18:30,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:18:30 BoogieIcfgContainer [2021-12-16 03:18:30,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:18:30,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:18:30,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:18:30,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:18:30,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:18:26" (1/3) ... [2021-12-16 03:18:30,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7705b326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:18:30, skipping insertion in model container [2021-12-16 03:18:30,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:29" (2/3) ... [2021-12-16 03:18:30,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7705b326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:18:30, skipping insertion in model container [2021-12-16 03:18:30,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:18:30" (3/3) ... [2021-12-16 03:18:30,641 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-16 03:18:30,646 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:18:30,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:18:30,689 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:18:30,694 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 03:18:30,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 03:18:30,711 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) [2021-12-16 03:18:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 03:18:30,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:30,719 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:30,720 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-16 03:18:30,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817740613] [2021-12-16 03:18:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:30,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:18:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 03:18:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 03:18:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 03:18:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-16 03:18:31,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:31,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817740613] [2021-12-16 03:18:31,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817740613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:31,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:31,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 03:18:31,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575696496] [2021-12-16 03:18:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:31,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 03:18:31,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 03:18:31,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 03:18:31,401 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) [2021-12-16 03:18:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:31,567 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-16 03:18:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 03:18:31,569 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 [2021-12-16 03:18:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:31,579 INFO L225 Difference]: With dead ends: 139 [2021-12-16 03:18:31,579 INFO L226 Difference]: Without dead ends: 65 [2021-12-16 03:18:31,583 INFO L932 BasicCegarLoop]: 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 [2021-12-16 03:18:31,591 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:31,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:18:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-16 03:18:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-16 03:18:31,641 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) [2021-12-16 03:18:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-16 03:18:31,648 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-16 03:18:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:31,650 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-16 03:18:31,650 INFO L471 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) [2021-12-16 03:18:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-16 03:18:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-16 03:18:31,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:31,653 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:31,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:18:31,654 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-16 03:18:31,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:31,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73290335] [2021-12-16 03:18:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:31,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:31,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:18:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 03:18:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 03:18:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 03:18:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 03:18:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-16 03:18:32,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:32,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73290335] [2021-12-16 03:18:32,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73290335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:32,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:32,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-16 03:18:32,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099173492] [2021-12-16 03:18:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:32,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 03:18:32,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 03:18:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-16 03:18:32,219 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) [2021-12-16 03:18:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:32,569 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-16 03:18:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 03:18:32,570 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 [2021-12-16 03:18:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:32,572 INFO L225 Difference]: With dead ends: 89 [2021-12-16 03:18:32,572 INFO L226 Difference]: Without dead ends: 65 [2021-12-16 03:18:32,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-12-16 03:18:32,573 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:32,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 497 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:18:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-16 03:18:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-16 03:18:32,582 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) [2021-12-16 03:18:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-16 03:18:32,583 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-16 03:18:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:32,584 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-16 03:18:32,584 INFO L471 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) [2021-12-16 03:18:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-16 03:18:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-16 03:18:32,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:32,586 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:32,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:18:32,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-16 03:18:32,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124251105] [2021-12-16 03:18:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:32,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:18:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 03:18:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 03:18:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 03:18:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 03:18:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 03:18:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-16 03:18:33,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124251105] [2021-12-16 03:18:33,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124251105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:33,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:33,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-16 03:18:33,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17785282] [2021-12-16 03:18:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:33,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:18:33,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:18:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:18:33,136 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) [2021-12-16 03:18:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:33,582 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-16 03:18:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 03:18:33,583 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 [2021-12-16 03:18:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:33,584 INFO L225 Difference]: With dead ends: 94 [2021-12-16 03:18:33,585 INFO L226 Difference]: Without dead ends: 92 [2021-12-16 03:18:33,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-12-16 03:18:33,586 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:33,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 721 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:18:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-16 03:18:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-16 03:18:33,596 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) [2021-12-16 03:18:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-16 03:18:33,598 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-16 03:18:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:33,599 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-16 03:18:33,599 INFO L471 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) [2021-12-16 03:18:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-16 03:18:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 03:18:33,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:33,601 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:33,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 03:18:33,601 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-16 03:18:33,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:33,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905957612] [2021-12-16 03:18:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:33,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:18:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 03:18:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 03:18:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 03:18:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 03:18:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 03:18:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 03:18:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-16 03:18:34,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:34,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905957612] [2021-12-16 03:18:34,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905957612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:34,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:34,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:18:34,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011191657] [2021-12-16 03:18:34,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:34,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:18:34,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:34,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:18:34,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:18:34,031 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) [2021-12-16 03:18:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:34,331 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-16 03:18:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 03:18:34,331 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 [2021-12-16 03:18:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:34,333 INFO L225 Difference]: With dead ends: 98 [2021-12-16 03:18:34,333 INFO L226 Difference]: Without dead ends: 96 [2021-12-16 03:18:34,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-16 03:18:34,335 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 57 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:34,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 635 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:18:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-16 03:18:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-16 03:18:34,343 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) [2021-12-16 03:18:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-16 03:18:34,344 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-16 03:18:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:34,345 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-16 03:18:34,345 INFO L471 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) [2021-12-16 03:18:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-16 03:18:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-16 03:18:34,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:34,347 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:34,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:18:34,347 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-16 03:18:34,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:34,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493827688] [2021-12-16 03:18:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:34,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:18:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 03:18:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-16 03:18:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 03:18:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 03:18:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 03:18:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 03:18:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-16 03:18:34,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:34,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493827688] [2021-12-16 03:18:34,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493827688] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:34,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:34,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-16 03:18:34,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655933429] [2021-12-16 03:18:34,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:34,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 03:18:34,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 03:18:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:18:34,844 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) [2021-12-16 03:18:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:35,237 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-16 03:18:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 03:18:35,238 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 [2021-12-16 03:18:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:35,240 INFO L225 Difference]: With dead ends: 102 [2021-12-16 03:18:35,240 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 03:18:35,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-12-16 03:18:35,241 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:35,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1006 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:18:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 03:18:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-16 03:18:35,250 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) [2021-12-16 03:18:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-16 03:18:35,251 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-16 03:18:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:35,251 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-16 03:18:35,252 INFO L471 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) [2021-12-16 03:18:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-16 03:18:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-16 03:18:35,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:35,257 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:35,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 03:18:35,257 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:35,258 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-16 03:18:35,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:35,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784614920] [2021-12-16 03:18:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:35,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-16 03:18:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 03:18:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-16 03:18:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 03:18:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 03:18:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 03:18:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 03:18:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 03:18:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-16 03:18:35,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:35,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784614920] [2021-12-16 03:18:35,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784614920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:35,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:35,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-16 03:18:35,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246878116] [2021-12-16 03:18:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:35,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 03:18:35,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:35,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 03:18:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:18:35,936 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) [2021-12-16 03:18:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:36,273 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-16 03:18:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 03:18:36,273 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 [2021-12-16 03:18:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:36,276 INFO L225 Difference]: With dead ends: 100 [2021-12-16 03:18:36,276 INFO L226 Difference]: Without dead ends: 96 [2021-12-16 03:18:36,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-16 03:18:36,277 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:36,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 560 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:18:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-16 03:18:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-16 03:18:36,283 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) [2021-12-16 03:18:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-16 03:18:36,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-16 03:18:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:36,284 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-16 03:18:36,284 INFO L471 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) [2021-12-16 03:18:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-16 03:18:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-16 03:18:36,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:36,286 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:36,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:18:36,286 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-16 03:18:36,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:36,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296432979] [2021-12-16 03:18:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:36,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 03:18:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 03:18:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 03:18:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 03:18:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 03:18:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 03:18:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 03:18:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 03:18:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 03:18:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 03:18:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 03:18:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 03:18:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 03:18:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-16 03:18:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-16 03:18:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 03:18:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-16 03:18:37,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:18:37,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296432979] [2021-12-16 03:18:37,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296432979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:37,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:37,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-16 03:18:37,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991120685] [2021-12-16 03:18:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:37,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 03:18:37,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:18:37,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 03:18:37,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:18:37,009 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) [2021-12-16 03:18:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:37,399 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-16 03:18:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 03:18:37,400 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 [2021-12-16 03:18:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:37,402 INFO L225 Difference]: With dead ends: 102 [2021-12-16 03:18:37,402 INFO L226 Difference]: Without dead ends: 71 [2021-12-16 03:18:37,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-16 03:18:37,403 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:37,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 723 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:18:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-16 03:18:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-16 03:18:37,408 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) [2021-12-16 03:18:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-16 03:18:37,409 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-16 03:18:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:37,409 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-16 03:18:37,409 INFO L471 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) [2021-12-16 03:18:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-16 03:18:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-16 03:18:37,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:37,411 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:37,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 03:18:37,411 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-16 03:18:37,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:18:37,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314589054] [2021-12-16 03:18:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:37,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:18:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 03:18:37,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 03:18:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 03:18:37,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 03:18:37,883 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 03:18:37,883 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 03:18:37,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 03:18:37,888 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:18:37,890 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 03:18:37,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:18:37 BoogieIcfgContainer [2021-12-16 03:18:37,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 03:18:37,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 03:18:37,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 03:18:37,945 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 03:18:37,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:18:30" (3/4) ... [2021-12-16 03:18:37,948 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 03:18:37,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 03:18:37,949 INFO L158 Benchmark]: Toolchain (without parser) took 11393.21ms. Allocated memory was 107.0MB in the beginning and 251.7MB in the end (delta: 144.7MB). Free memory was 79.6MB in the beginning and 105.1MB in the end (delta: -25.4MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2021-12-16 03:18:37,949 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:18:37,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3202.14ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 79.4MB in the beginning and 99.2MB in the end (delta: -19.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2021-12-16 03:18:37,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 183.68ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 88.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 03:18:37,950 INFO L158 Benchmark]: Boogie Preprocessor took 91.77ms. Allocated memory is still 169.9MB. Free memory was 88.8MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 03:18:37,950 INFO L158 Benchmark]: RCFGBuilder took 593.17ms. Allocated memory is still 169.9MB. Free memory was 84.6MB in the beginning and 102.2MB in the end (delta: -17.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-12-16 03:18:37,951 INFO L158 Benchmark]: TraceAbstraction took 7310.12ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 101.2MB in the beginning and 105.1MB in the end (delta: -3.9MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2021-12-16 03:18:37,951 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 251.7MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:18:37,952 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.20ms. Allocated memory is still 107.0MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3202.14ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 79.4MB in the beginning and 99.2MB in the end (delta: -19.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 183.68ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 88.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.77ms. Allocated memory is still 169.9MB. Free memory was 88.8MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 593.17ms. Allocated memory is still 169.9MB. Free memory was 84.6MB in the beginning and 102.2MB in the end (delta: -17.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7310.12ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 101.2MB in the beginning and 105.1MB in the end (delta: -3.9MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 251.7MB. Free memory is still 105.1MB. 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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=36028797018963966, nondet_uint64_t()=18482772870728515581, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=36028797018963966, a={-2:0}, a={-2:0}, a[i]=257, b={-3:0}, b={-3:0}, b[i]=0, i=36028797018963965, len=36028797018963966, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 4255 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3740 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2486 IncrementalHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 515 mSDtfsCounter, 2486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1897 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 [2021-12-16 03:18:37,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 03:18:39,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:18:39,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:18:39,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:18:39,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:18:39,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:18:39,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:18:39,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:18:39,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:18:39,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:18:39,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:18:39,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:18:39,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:18:39,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:18:39,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:18:39,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:18:39,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:18:39,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:18:39,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:18:39,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:18:39,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:18:39,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:18:39,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:18:39,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:18:40,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:18:40,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:18:40,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:18:40,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:18:40,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:18:40,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:18:40,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:18:40,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:18:40,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:18:40,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:18:40,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:18:40,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:18:40,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:18:40,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:18:40,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:18:40,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:18:40,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:18:40,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-16 03:18:40,054 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:18:40,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:18:40,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:18:40,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:18:40,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:18:40,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:18:40,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:18:40,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:18:40,059 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:18:40,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:18:40,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:18:40,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:18:40,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:18:40,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:18:40,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 03:18:40,061 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 03:18:40,061 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 03:18:40,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:18:40,062 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:18:40,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:18:40,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:18:40,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:18:40,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:18:40,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:18:40,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:18:40,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:18:40,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:18:40,063 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 03:18:40,063 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 03:18:40,064 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:18:40,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:18:40,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:18:40,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:18:40,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 03:18:40,065 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-12-16 03:18:40,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:18:40,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:18:40,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:18:40,388 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:18:40,389 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:18:40,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-16 03:18:40,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2afcdb2/79a2c8691b2a45c7989fc7f12ec71fcb/FLAG53b3b5cfb [2021-12-16 03:18:41,255 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:18:41,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2021-12-16 03:18:41,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2afcdb2/79a2c8691b2a45c7989fc7f12ec71fcb/FLAG53b3b5cfb [2021-12-16 03:18:41,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2afcdb2/79a2c8691b2a45c7989fc7f12ec71fcb [2021-12-16 03:18:41,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:18:41,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:18:41,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:18:41,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:18:41,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:18:41,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:18:41" (1/1) ... [2021-12-16 03:18:41,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722dd13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:41, skipping insertion in model container [2021-12-16 03:18:41,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:18:41" (1/1) ... [2021-12-16 03:18:41,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:18:41,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:18:41,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-16 03:18:41,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-16 03:18:42,774 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,775 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,782 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,795 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,801 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,803 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:42,812 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,119 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:18:43,120 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:18:43,121 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:18:43,122 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:18:43,123 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:18:43,124 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:18:43,124 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:18:43,125 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:18:43,125 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:18:43,126 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:18:43,287 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:18:43,390 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,392 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,685 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,687 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,717 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,719 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,724 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,725 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,738 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,740 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,740 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,741 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,741 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,742 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,743 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:43,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:18:43,854 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-16 03:18:43,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:18:43,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-16 03:18:43,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-16 03:18:44,010 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,011 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,013 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,014 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,014 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,018 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,019 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,019 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,019 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,048 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:18:44,049 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:18:44,049 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:18:44,050 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:18:44,050 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:18:44,050 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:18:44,051 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:18:44,051 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:18:44,052 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:18:44,052 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:18:44,064 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:18:44,126 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,128 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,204 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,205 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,210 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,210 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,212 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,212 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,218 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,219 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,219 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,219 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,220 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,221 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,221 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:18:44,289 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:18:44,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2021-12-16 03:18:44,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2021-12-16 03:18:44,379 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,379 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,380 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,380 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,381 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,385 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,397 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,409 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,410 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,453 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-16 03:18:44,454 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-16 03:18:44,454 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-16 03:18:44,455 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-16 03:18:44,456 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-16 03:18:44,456 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-16 03:18:44,457 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-16 03:18:44,458 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-16 03:18:44,458 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-16 03:18:44,458 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-16 03:18:44,476 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-16 03:18:44,610 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,611 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,663 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,663 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,668 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,669 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,670 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,671 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,677 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,678 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,679 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,679 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,680 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,680 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,680 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-16 03:18:44,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:18:44,933 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:18:44,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44 WrapperNode [2021-12-16 03:18:44,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:18:44,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:18:44,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:18:44,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:18:44,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,175 INFO L137 Inliner]: procedures = 788, calls = 3253, calls flagged for inlining = 80, calls inlined = 5, statements flattened = 338 [2021-12-16 03:18:45,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:18:45,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:18:45,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:18:45,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:18:45,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:18:45,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:18:45,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:18:45,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:18:45,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (1/1) ... [2021-12-16 03:18:45,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:18:45,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:18:45,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 03:18:45,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 03:18:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-16 03:18:45,330 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-16 03:18:45,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 03:18:45,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 03:18:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 03:18:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:18:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:18:45,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:18:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-16 03:18:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-16 03:18:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-16 03:18:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-16 03:18:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 03:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-16 03:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-16 03:18:45,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-16 03:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 03:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2021-12-16 03:18:45,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2021-12-16 03:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2021-12-16 03:18:45,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2021-12-16 03:18:45,607 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:18:45,616 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:18:45,896 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-16 03:18:45,913 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:18:45,919 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:18:45,919 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 03:18:45,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:18:45 BoogieIcfgContainer [2021-12-16 03:18:45,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:18:45,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:18:45,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:18:45,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:18:45,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:18:41" (1/3) ... [2021-12-16 03:18:45,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343a00b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:18:45, skipping insertion in model container [2021-12-16 03:18:45,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:18:44" (2/3) ... [2021-12-16 03:18:45,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343a00b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:18:45, skipping insertion in model container [2021-12-16 03:18:45,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:18:45" (3/3) ... [2021-12-16 03:18:45,928 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2021-12-16 03:18:45,932 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:18:45,933 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:18:45,989 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:18:45,996 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 03:18:45,997 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 03:18:46,011 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) [2021-12-16 03:18:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 03:18:46,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:46,018 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:46,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2021-12-16 03:18:46,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:46,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997568544] [2021-12-16 03:18:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:46,037 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:46,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:46,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 03:18:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:46,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-16 03:18:46,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-16 03:18:46,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:46,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:46,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997568544] [2021-12-16 03:18:46,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997568544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:46,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:46,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 03:18:46,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330782430] [2021-12-16 03:18:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:46,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 03:18:46,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 03:18:46,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:18:46,474 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-16 03:18:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:46,498 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2021-12-16 03:18:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 03:18:46,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2021-12-16 03:18:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:46,507 INFO L225 Difference]: With dead ends: 139 [2021-12-16 03:18:46,507 INFO L226 Difference]: Without dead ends: 65 [2021-12-16 03:18:46,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:18:46,513 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:46,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 03:18:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-16 03:18:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-16 03:18:46,547 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) [2021-12-16 03:18:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2021-12-16 03:18:46,550 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2021-12-16 03:18:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:46,551 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2021-12-16 03:18:46,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-16 03:18:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2021-12-16 03:18:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-16 03:18:46,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:46,554 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:46,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-16 03:18:46,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:46,771 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2021-12-16 03:18:46,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:46,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303519661] [2021-12-16 03:18:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:46,796 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:46,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:46,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:46,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 03:18:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:47,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 03:18:47,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-16 03:18:47,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:47,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:47,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303519661] [2021-12-16 03:18:47,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303519661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:47,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:47,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-16 03:18:47,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782019231] [2021-12-16 03:18:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:47,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 03:18:47,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 03:18:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-16 03:18:47,367 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-16 03:18:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:47,616 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2021-12-16 03:18:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 03:18:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2021-12-16 03:18:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:47,618 INFO L225 Difference]: With dead ends: 89 [2021-12-16 03:18:47,618 INFO L226 Difference]: Without dead ends: 65 [2021-12-16 03:18:47,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:18:47,619 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:47,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 663 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:18:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-16 03:18:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-16 03:18:47,627 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) [2021-12-16 03:18:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-12-16 03:18:47,628 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2021-12-16 03:18:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:47,629 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-12-16 03:18:47,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-16 03:18:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-12-16 03:18:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-16 03:18:47,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:47,630 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:47,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-16 03:18:47,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:47,831 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2021-12-16 03:18:47,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836410969] [2021-12-16 03:18:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:47,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:47,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:47,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:47,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 03:18:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:48,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 03:18:48,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-16 03:18:48,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:48,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:48,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836410969] [2021-12-16 03:18:48,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836410969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:48,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:48,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-16 03:18:48,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918912136] [2021-12-16 03:18:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:48,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 03:18:48,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:48,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 03:18:48,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-16 03:18:48,375 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-16 03:18:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:48,779 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2021-12-16 03:18:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 03:18:48,780 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2021-12-16 03:18:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:48,782 INFO L225 Difference]: With dead ends: 94 [2021-12-16 03:18:48,782 INFO L226 Difference]: Without dead ends: 92 [2021-12-16 03:18:48,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-12-16 03:18:48,783 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:48,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 914 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 03:18:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-16 03:18:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2021-12-16 03:18:48,800 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) [2021-12-16 03:18:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2021-12-16 03:18:48,804 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2021-12-16 03:18:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:48,805 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2021-12-16 03:18:48,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2021-12-16 03:18:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2021-12-16 03:18:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 03:18:48,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:48,808 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:48,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-16 03:18:49,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:49,025 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2021-12-16 03:18:49,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:49,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247707190] [2021-12-16 03:18:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:49,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:49,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:49,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:49,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 03:18:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:49,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 03:18:49,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-16 03:18:49,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:49,655 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:49,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247707190] [2021-12-16 03:18:49,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247707190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:49,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:49,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-16 03:18:49,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744668261] [2021-12-16 03:18:49,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:49,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 03:18:49,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 03:18:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-16 03:18:49,659 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-16 03:18:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:49,921 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2021-12-16 03:18:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 03:18:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2021-12-16 03:18:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:49,924 INFO L225 Difference]: With dead ends: 98 [2021-12-16 03:18:49,924 INFO L226 Difference]: Without dead ends: 96 [2021-12-16 03:18:49,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:18:49,925 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:49,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 854 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:18:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-16 03:18:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-16 03:18:49,934 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) [2021-12-16 03:18:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-16 03:18:49,935 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2021-12-16 03:18:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:49,936 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-16 03:18:49,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2021-12-16 03:18:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-16 03:18:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-16 03:18:49,938 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:49,938 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:49,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-16 03:18:50,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:50,155 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2021-12-16 03:18:50,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:50,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898526157] [2021-12-16 03:18:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:50,156 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:50,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:50,158 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:50,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 03:18:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:50,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:18:50,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-16 03:18:50,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:50,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:50,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898526157] [2021-12-16 03:18:50,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898526157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:50,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:50,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:18:50,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233015854] [2021-12-16 03:18:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:50,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:18:50,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:18:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:18:50,726 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-16 03:18:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:51,019 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2021-12-16 03:18:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 03:18:51,020 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2021-12-16 03:18:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:51,021 INFO L225 Difference]: With dead ends: 102 [2021-12-16 03:18:51,021 INFO L226 Difference]: Without dead ends: 100 [2021-12-16 03:18:51,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-16 03:18:51,022 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 14 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:51,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1199 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:18:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-16 03:18:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-16 03:18:51,031 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) [2021-12-16 03:18:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-12-16 03:18:51,032 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2021-12-16 03:18:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:51,033 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-12-16 03:18:51,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2021-12-16 03:18:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-12-16 03:18:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-16 03:18:51,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:51,042 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:51,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 03:18:51,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:51,259 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:51,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2021-12-16 03:18:51,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:51,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70678191] [2021-12-16 03:18:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:51,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:51,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:51,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:51,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 03:18:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:51,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 03:18:51,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-16 03:18:51,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:51,879 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70678191] [2021-12-16 03:18:51,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70678191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:51,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:51,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-16 03:18:51,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881614318] [2021-12-16 03:18:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:51,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 03:18:51,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 03:18:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-16 03:18:51,881 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-16 03:18:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:52,098 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2021-12-16 03:18:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 03:18:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2021-12-16 03:18:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:52,101 INFO L225 Difference]: With dead ends: 100 [2021-12-16 03:18:52,101 INFO L226 Difference]: Without dead ends: 96 [2021-12-16 03:18:52,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-12-16 03:18:52,102 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:52,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 752 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 03:18:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-16 03:18:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2021-12-16 03:18:52,117 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) [2021-12-16 03:18:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-16 03:18:52,119 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2021-12-16 03:18:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:52,119 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-16 03:18:52,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-12-16 03:18:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-16 03:18:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-16 03:18:52,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:52,121 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:52,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-16 03:18:52,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:52,328 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2021-12-16 03:18:52,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:52,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816403679] [2021-12-16 03:18:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:52,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:52,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:52,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 03:18:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:18:52,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 03:18:52,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:18:52,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 03:18:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-16 03:18:52,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 03:18:52,887 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 03:18:52,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816403679] [2021-12-16 03:18:52,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816403679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:18:52,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:18:52,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 03:18:52,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519048227] [2021-12-16 03:18:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:18:52,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:18:52,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 03:18:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:18:52,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:18:52,889 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-16 03:18:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 03:18:53,036 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2021-12-16 03:18:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 03:18:53,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 100 [2021-12-16 03:18:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 03:18:53,038 INFO L225 Difference]: With dead ends: 102 [2021-12-16 03:18:53,038 INFO L226 Difference]: Without dead ends: 71 [2021-12-16 03:18:53,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 03:18:53,039 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 03:18:53,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 03:18:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-16 03:18:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-16 03:18:53,045 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) [2021-12-16 03:18:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-16 03:18:53,046 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2021-12-16 03:18:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 03:18:53,046 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-16 03:18:53,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-16 03:18:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-16 03:18:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-16 03:18:53,048 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 03:18:53,048 INFO L514 BasicCegarLoop]: 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] [2021-12-16 03:18:53,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-16 03:18:53,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:53,260 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 03:18:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:18:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2021-12-16 03:18:53,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 03:18:53,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685646460] [2021-12-16 03:18:53,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:18:53,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 03:18:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 03:18:53,262 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 03:18:53,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 03:18:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 03:18:53,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 03:18:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 03:18:54,516 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-16 03:18:54,516 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 03:18:54,517 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 03:18:54,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 03:18:54,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 03:18:54,743 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 03:18:54,745 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 03:18:54,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:18:54 BoogieIcfgContainer [2021-12-16 03:18:54,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 03:18:54,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 03:18:54,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 03:18:54,836 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 03:18:54,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:18:45" (3/4) ... [2021-12-16 03:18:54,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 03:18:54,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 03:18:54,839 INFO L158 Benchmark]: Toolchain (without parser) took 13523.07ms. Allocated memory was 60.8MB in the beginning and 373.3MB in the end (delta: 312.5MB). Free memory was 34.0MB in the beginning and 298.1MB in the end (delta: -264.1MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2021-12-16 03:18:54,840 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 46.1MB. Free memory was 28.7MB in the beginning and 28.7MB in the end (delta: 43.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:18:54,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3615.19ms. Allocated memory was 60.8MB in the beginning and 251.7MB in the end (delta: 190.8MB). Free memory was 33.8MB in the beginning and 131.3MB in the end (delta: -97.5MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2021-12-16 03:18:54,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 240.84ms. Allocated memory is still 251.7MB. Free memory was 131.3MB in the beginning and 182.8MB in the end (delta: -51.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 03:18:54,840 INFO L158 Benchmark]: Boogie Preprocessor took 70.19ms. Allocated memory is still 251.7MB. Free memory was 182.8MB in the beginning and 177.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 03:18:54,841 INFO L158 Benchmark]: RCFGBuilder took 673.70ms. Allocated memory is still 251.7MB. Free memory was 177.5MB in the beginning and 144.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-16 03:18:54,841 INFO L158 Benchmark]: TraceAbstraction took 8911.92ms. Allocated memory was 251.7MB in the beginning and 373.3MB in the end (delta: 121.6MB). Free memory was 144.0MB in the beginning and 298.1MB in the end (delta: -154.1MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2021-12-16 03:18:54,842 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 373.3MB. Free memory is still 298.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 03:18:54,843 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.17ms. Allocated memory is still 46.1MB. Free memory was 28.7MB in the beginning and 28.7MB in the end (delta: 43.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3615.19ms. Allocated memory was 60.8MB in the beginning and 251.7MB in the end (delta: 190.8MB). Free memory was 33.8MB in the beginning and 131.3MB in the end (delta: -97.5MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 240.84ms. Allocated memory is still 251.7MB. Free memory was 131.3MB in the beginning and 182.8MB in the end (delta: -51.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.19ms. Allocated memory is still 251.7MB. Free memory was 182.8MB in the beginning and 177.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 673.70ms. Allocated memory is still 251.7MB. Free memory was 177.5MB in the beginning and 144.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8911.92ms. Allocated memory was 251.7MB in the beginning and 373.3MB in the end (delta: 121.6MB). Free memory was 144.0MB in the beginning and 298.1MB in the end (delta: -154.1MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 373.3MB. Free memory is still 298.1MB. 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={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={14:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={14:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, size=64] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={9:0}, cap=64, max_size=64, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={9:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str1={14: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={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={14:0}, str={14:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}, str={9:0}, str={9:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={14:0}, a={14: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={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={14:0}, a={14: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={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={14:0}, a={14: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={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L10799] return rval; VAL [\result=1, a={14:0}, a={14:0}, b={9:0}, b={9:0}, rval=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, len=1073741824, nondet_uint64_t()=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6: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={5:0}, s_tolower_table={6:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1073741824, a={14:0}, a={14:0}, b={9:0}, b={9:0}, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=1073741824, a={14:0}, a={14:0}, a[i]=48, b={9:0}, b={9:0}, b[i]=-128, i=0, len=1073741824, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={5:0}, s_tolower_table={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 5015 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4468 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 547 mSDtfsCounter, 958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1351 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3221 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-16 03:18:54,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample