./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_iter_delete_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 7608d8aa64807891206ad38b93db31434f261f46ffbbb3a8b8a4940e4ab5ce81 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:05:43,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:05:43,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:05:43,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:05:43,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:05:43,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:05:43,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:05:43,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:05:43,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:05:43,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:05:43,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:05:43,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:05:43,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:05:43,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:05:43,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:05:43,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:05:43,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:05:43,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:05:43,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:05:43,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:05:43,185 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:05:43,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:05:43,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:05:43,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:05:43,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:05:43,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:05:43,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:05:43,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:05:43,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:05:43,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:05:43,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:05:43,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:05:43,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:05:43,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:05:43,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:05:43,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:05:43,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:05:43,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:05:43,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:05:43,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:05:43,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:05:43,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:05:43,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:05:43,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:05:43,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:05:43,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:05:43,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:05:43,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:05:43,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:05:43,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:05:43,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:05:43,226 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:05:43,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:05:43,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:05:43,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:05:43,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:05:43,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:05:43,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:05:43,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:05:43,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:05:43,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:05:43,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:05:43,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:05:43,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:05:43,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:05:43,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:05:43,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:05:43,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:05:43,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:05:43,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:05:43,230 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:05:43,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:05:43,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:05:43,231 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 -> 7608d8aa64807891206ad38b93db31434f261f46ffbbb3a8b8a4940e4ab5ce81 [2022-07-12 11:05:43,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:05:43,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:05:43,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:05:43,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:05:43,422 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:05:43,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness.i [2022-07-12 11:05:43,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a63c63b/0556b097b854413ea6783b7dc027d467/FLAGf32516f9d [2022-07-12 11:05:44,075 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:05:44,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness.i [2022-07-12 11:05:44,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a63c63b/0556b097b854413ea6783b7dc027d467/FLAGf32516f9d [2022-07-12 11:05:44,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a63c63b/0556b097b854413ea6783b7dc027d467 [2022-07-12 11:05:44,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:05:44,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:05:44,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:05:44,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:05:44,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:05:44,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:05:44" (1/1) ... [2022-07-12 11:05:44,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6467e413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:44, skipping insertion in model container [2022-07-12 11:05:44,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:05:44" (1/1) ... [2022-07-12 11:05:44,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:05:44,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:05:44,817 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_iter_delete_harness.i[4494,4507] [2022-07-12 11:05:44,824 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_iter_delete_harness.i[4554,4567] [2022-07-12 11:05:45,475 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,476 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,476 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,477 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,478 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,493 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,493 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,495 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,497 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,497 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,499 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,499 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,500 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,701 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:05:45,702 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:05:45,703 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:05:45,704 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:05:45,705 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:05:45,707 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:05:45,707 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:05:45,707 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:05:45,708 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:05:45,708 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:05:45,793 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:05:45,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:45,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,016 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,018 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,024 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,025 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,040 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,042 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,043 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,044 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,044 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,044 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,044 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:05:46,110 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:05:46,128 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_iter_delete_harness.i[4494,4507] [2022-07-12 11:05:46,129 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_iter_delete_harness.i[4554,4567] [2022-07-12 11:05:46,158 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,158 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,158 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,159 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,159 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,163 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,164 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,182 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:05:46,182 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:05:46,183 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:05:46,185 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:05:46,185 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:05:46,185 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:05:46,186 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:05:46,186 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:05:46,186 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:05:46,186 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:05:46,199 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:05:46,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,280 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,285 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,294 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,296 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:05:46,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:05:46,467 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:05:46,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46 WrapperNode [2022-07-12 11:05:46,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:05:46,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:05:46,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:05:46,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:05:46,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,615 INFO L137 Inliner]: procedures = 774, calls = 2460, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 732 [2022-07-12 11:05:46,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:05:46,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:05:46,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:05:46,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:05:46,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:05:46,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:05:46,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:05:46,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:05:46,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (1/1) ... [2022-07-12 11:05:46,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:05:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:46,728 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) [2022-07-12 11:05:46,743 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 [2022-07-12 11:05:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 11:05:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:05:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:05:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:05:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 11:05:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 11:05:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:05:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:05:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-12 11:05:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-12 11:05:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:05:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:05:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:05:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:05:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:05:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:05:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:05:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-12 11:05:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-12 11:05:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 11:05:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 11:05:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:05:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-12 11:05:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-12 11:05:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:05:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:05:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:05:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:05:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-12 11:05:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-12 11:05:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:05:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-12 11:05:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-12 11:05:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:05:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:05:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:05:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:05:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2022-07-12 11:05:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2022-07-12 11:05:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-12 11:05:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-12 11:05:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:05:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-12 11:05:46,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-12 11:05:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-12 11:05:46,765 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-12 11:05:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2022-07-12 11:05:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2022-07-12 11:05:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_delete [2022-07-12 11:05:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_delete [2022-07-12 11:05:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:05:46,995 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:05:47,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:05:47,165 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !true; [2022-07-12 11:05:47,165 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-07-12 11:05:47,691 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:05:47,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:05:47,699 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-12 11:05:47,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:05:47 BoogieIcfgContainer [2022-07-12 11:05:47,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:05:47,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:05:47,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:05:47,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:05:47,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:05:44" (1/3) ... [2022-07-12 11:05:47,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2366bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:05:47, skipping insertion in model container [2022-07-12 11:05:47,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:05:46" (2/3) ... [2022-07-12 11:05:47,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2366bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:05:47, skipping insertion in model container [2022-07-12 11:05:47,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:05:47" (3/3) ... [2022-07-12 11:05:47,706 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_delete_harness.i [2022-07-12 11:05:47,715 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:05:47,715 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:05:47,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:05:47,748 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13c96c35, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73661f98 [2022-07-12 11:05:47,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:05:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 136 states have internal predecessors, (173), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-12 11:05:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-12 11:05:47,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:47,763 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:47,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:47,766 INFO L85 PathProgramCache]: Analyzing trace with hash 778506499, now seen corresponding path program 1 times [2022-07-12 11:05:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:47,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389278233] [2022-07-12 11:05:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:05:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:05:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:05:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:48,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:48,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389278233] [2022-07-12 11:05:48,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-12 11:05:48,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436000378] [2022-07-12 11:05:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:48,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:48,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:48,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:05:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:48,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 11:05:48,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2022-07-12 11:05:48,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:05:48,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436000378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:48,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:48,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:05:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720255085] [2022-07-12 11:05:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:48,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:05:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:05:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:05:48,789 INFO L87 Difference]: Start difference. First operand has 210 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 136 states have internal predecessors, (173), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-12 11:05:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:48,841 INFO L93 Difference]: Finished difference Result 415 states and 583 transitions. [2022-07-12 11:05:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:05:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2022-07-12 11:05:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:48,851 INFO L225 Difference]: With dead ends: 415 [2022-07-12 11:05:48,851 INFO L226 Difference]: Without dead ends: 205 [2022-07-12 11:05:48,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:05:48,856 INFO L413 NwaCegarLoop]: 273 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, 273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:48,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:05:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-12 11:05:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-12 11:05:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 131 states have (on average 1.2290076335877862) internal successors, (161), 132 states have internal predecessors, (161), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-07-12 11:05:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2022-07-12 11:05:48,911 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 201 [2022-07-12 11:05:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:48,912 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2022-07-12 11:05:48,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-12 11:05:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2022-07-12 11:05:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-12 11:05:48,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:48,916 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:48,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:05:49,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-12 11:05:49,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash -309437507, now seen corresponding path program 1 times [2022-07-12 11:05:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:49,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62666267] [2022-07-12 11:05:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:49,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:05:49,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683041288] [2022-07-12 11:05:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:49,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:49,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:49,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:05:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:49,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:05:49,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-07-12 11:05:49,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:05:49,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:49,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62666267] [2022-07-12 11:05:49,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:05:49,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683041288] [2022-07-12 11:05:49,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683041288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:49,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:49,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:05:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583417854] [2022-07-12 11:05:49,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:49,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:05:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:05:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:05:49,706 INFO L87 Difference]: Start difference. First operand 205 states and 268 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-12 11:05:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:49,757 INFO L93 Difference]: Finished difference Result 373 states and 491 transitions. [2022-07-12 11:05:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:05:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2022-07-12 11:05:49,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:49,763 INFO L225 Difference]: With dead ends: 373 [2022-07-12 11:05:49,764 INFO L226 Difference]: Without dead ends: 210 [2022-07-12 11:05:49,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:05:49,766 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 2 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:49,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:05:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-12 11:05:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-07-12 11:05:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 136 states have internal predecessors, (165), 54 states have call successors, (54), 19 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 53 states have call successors, (54) [2022-07-12 11:05:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2022-07-12 11:05:49,784 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 201 [2022-07-12 11:05:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:49,786 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2022-07-12 11:05:49,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-12 11:05:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2022-07-12 11:05:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 11:05:49,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:49,793 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:49,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:05:50,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-12 11:05:50,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2085577371, now seen corresponding path program 1 times [2022-07-12 11:05:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:50,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164004717] [2022-07-12 11:05:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:05:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:05:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:05:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:05:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:05:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:05:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:05:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:05:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:05:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:05:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:05:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:05:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:05:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:05:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:05:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:05:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:05:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:05:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:05:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:05:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:05:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 11:05:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:05:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 11:05:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 11:05:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 11:05:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-07-12 11:05:50,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:50,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164004717] [2022-07-12 11:05:50,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164004717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:50,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:50,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:05:50,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807100210] [2022-07-12 11:05:50,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:50,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:05:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:05:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:05:50,566 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2022-07-12 11:05:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:51,799 INFO L93 Difference]: Finished difference Result 378 states and 499 transitions. [2022-07-12 11:05:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:05:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 207 [2022-07-12 11:05:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:51,802 INFO L225 Difference]: With dead ends: 378 [2022-07-12 11:05:51,802 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 11:05:51,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:05:51,804 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 380 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:51,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 630 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 11:05:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 11:05:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 215. [2022-07-12 11:05:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 139 states have (on average 1.223021582733813) internal successors, (170), 141 states have internal predecessors, (170), 54 states have call successors, (54), 19 states have call predecessors, (54), 21 states have return successors, (55), 54 states have call predecessors, (55), 53 states have call successors, (55) [2022-07-12 11:05:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2022-07-12 11:05:51,845 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 207 [2022-07-12 11:05:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:51,845 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2022-07-12 11:05:51,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2022-07-12 11:05:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2022-07-12 11:05:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 11:05:51,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:51,848 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:51,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:05:51,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1668960419, now seen corresponding path program 1 times [2022-07-12 11:05:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:51,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795420091] [2022-07-12 11:05:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:51,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:05:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:05:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:05:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:05:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:05:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:05:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:05:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:05:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:05:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:05:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:05:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:05:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:05:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:05:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:05:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:05:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:05:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:05:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:05:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:05:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:05:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 11:05:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 11:05:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:05:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 11:05:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 11:05:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 11:05:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-07-12 11:05:52,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:52,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795420091] [2022-07-12 11:05:52,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795420091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:05:52,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:05:52,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:05:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335884220] [2022-07-12 11:05:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:05:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:05:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:05:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:05:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:05:52,221 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 11:05:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:05:52,747 INFO L93 Difference]: Finished difference Result 385 states and 507 transitions. [2022-07-12 11:05:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:05:52,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 207 [2022-07-12 11:05:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:05:52,749 INFO L225 Difference]: With dead ends: 385 [2022-07-12 11:05:52,749 INFO L226 Difference]: Without dead ends: 231 [2022-07-12 11:05:52,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:05:52,750 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 266 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:05:52,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 401 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 11:05:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-12 11:05:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2022-07-12 11:05:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 142 states have internal predecessors, (171), 55 states have call successors, (55), 19 states have call predecessors, (55), 21 states have return successors, (56), 55 states have call predecessors, (56), 54 states have call successors, (56) [2022-07-12 11:05:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2022-07-12 11:05:52,762 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 207 [2022-07-12 11:05:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:05:52,762 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2022-07-12 11:05:52,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-12 11:05:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2022-07-12 11:05:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 11:05:52,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:05:52,765 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:05:52,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:05:52,765 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:05:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:05:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -336287017, now seen corresponding path program 1 times [2022-07-12 11:05:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:05:52,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658493826] [2022-07-12 11:05:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:05:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:05:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:05:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:05:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:05:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:05:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:05:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:05:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:05:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:05:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:05:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:05:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:05:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:05:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 11:05:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:05:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 11:05:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:05:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:05:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:05:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:05:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:05:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:05:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 11:05:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:05:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:05:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:05:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 11:05:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:05:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 11:05:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 11:05:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:05:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 11:05:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2022-07-12 11:05:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:05:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658493826] [2022-07-12 11:05:53,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658493826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:05:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857573977] [2022-07-12 11:05:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:05:53,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:05:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:05:53,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:05:53,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:05:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:05:53,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 11:05:53,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:05:54,415 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-12 11:06:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-07-12 11:06:00,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:06:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857573977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:06:00,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:06:00,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-12 11:06:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381587016] [2022-07-12 11:06:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:06:00,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:06:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:06:00,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:06:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-12 11:06:00,255 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-12 11:06:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:06:00,433 INFO L93 Difference]: Finished difference Result 378 states and 504 transitions. [2022-07-12 11:06:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:06:00,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) Word has length 213 [2022-07-12 11:06:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:06:00,435 INFO L225 Difference]: With dead ends: 378 [2022-07-12 11:06:00,435 INFO L226 Difference]: Without dead ends: 220 [2022-07-12 11:06:00,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-12 11:06:00,436 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 5 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:06:00,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1429 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 399 Unchecked, 0.1s Time] [2022-07-12 11:06:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-12 11:06:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2022-07-12 11:06:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 143 states have internal predecessors, (173), 55 states have call successors, (55), 20 states have call predecessors, (55), 21 states have return successors, (56), 55 states have call predecessors, (56), 54 states have call successors, (56) [2022-07-12 11:06:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2022-07-12 11:06:00,446 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 213 [2022-07-12 11:06:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:06:00,447 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2022-07-12 11:06:00,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-12 11:06:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2022-07-12 11:06:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-12 11:06:00,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:06:00,450 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:06:00,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:06:00,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:06:00,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:06:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:06:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash 54254165, now seen corresponding path program 1 times [2022-07-12 11:06:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:06:00,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422301556] [2022-07-12 11:06:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:06:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:06:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:06:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:06:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:06:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:06:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:06:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:06:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:06:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:06:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:06:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:06:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:06:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:06:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:06:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:06:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:06:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:06:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:06:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:06:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:00,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:06:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 11:06:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:06:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:06:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:06:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:06:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:06:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:06:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 11:06:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 11:06:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 11:06:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 11:06:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 11:06:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2022-07-12 11:06:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:06:01,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422301556] [2022-07-12 11:06:01,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422301556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:06:01,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636074967] [2022-07-12 11:06:01,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:01,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:06:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:06:01,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:06:01,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:06:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:01,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 11:06:01,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:06:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-12 11:06:01,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:06:01,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636074967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:06:01,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:06:01,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2022-07-12 11:06:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618237145] [2022-07-12 11:06:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:06:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:06:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:06:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:06:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:06:01,527 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 11:06:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:06:01,660 INFO L93 Difference]: Finished difference Result 355 states and 466 transitions. [2022-07-12 11:06:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:06:01,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 218 [2022-07-12 11:06:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:06:01,663 INFO L225 Difference]: With dead ends: 355 [2022-07-12 11:06:01,663 INFO L226 Difference]: Without dead ends: 221 [2022-07-12 11:06:01,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:06:01,664 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:06:01,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1182 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:06:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-12 11:06:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-12 11:06:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 145 states have internal predecessors, (174), 55 states have call successors, (55), 20 states have call predecessors, (55), 22 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2022-07-12 11:06:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 288 transitions. [2022-07-12 11:06:01,673 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 288 transitions. Word has length 218 [2022-07-12 11:06:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:06:01,673 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 288 transitions. [2022-07-12 11:06:01,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-12 11:06:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 288 transitions. [2022-07-12 11:06:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-07-12 11:06:01,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:06:01,689 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:06:01,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:06:01,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:06:01,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:06:01,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:06:01,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1846575800, now seen corresponding path program 1 times [2022-07-12 11:06:01,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:06:01,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338812027] [2022-07-12 11:06:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:01,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:06:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:06:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:06:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:06:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:06:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:06:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:06:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:06:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:06:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:06:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:06:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:06:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:06:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:06:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:06:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:06:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:06:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:06:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:06:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 11:06:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:06:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:06:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:06:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:06:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 11:06:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:06:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 11:06:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 11:06:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 11:06:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 11:06:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 11:06:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 11:06:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 11:06:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 11:06:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 11:06:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2022-07-12 11:06:02,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:06:02,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338812027] [2022-07-12 11:06:02,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338812027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:06:02,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266962877] [2022-07-12 11:06:02,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:06:02,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:06:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:06:02,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:06:02,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:06:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:06:02,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 11:06:02,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:06:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 364 proven. 47 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-12 11:06:02,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:06:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2022-07-12 11:06:03,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266962877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:06:03,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:06:03,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-12 11:06:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750381900] [2022-07-12 11:06:03,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:06:03,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:06:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:06:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:06:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:06:03,035 INFO L87 Difference]: Start difference. First operand 221 states and 288 transitions. Second operand has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 12 states have internal predecessors, (187), 9 states have call successors, (95), 6 states have call predecessors, (95), 5 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2022-07-12 11:06:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:06:03,499 INFO L93 Difference]: Finished difference Result 280 states and 360 transitions. [2022-07-12 11:06:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:06:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 12 states have internal predecessors, (187), 9 states have call successors, (95), 6 states have call predecessors, (95), 5 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) Word has length 230 [2022-07-12 11:06:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:06:03,500 INFO L225 Difference]: With dead ends: 280 [2022-07-12 11:06:03,500 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:06:03,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:06:03,502 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 190 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:06:03,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 720 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:06:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:06:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:06:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 11:06:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:06:03,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2022-07-12 11:06:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:06:03,505 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:06:03,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 12 states have internal predecessors, (187), 9 states have call successors, (95), 6 states have call predecessors, (95), 5 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2022-07-12 11:06:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:06:03,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:06:03,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:06:03,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:06:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:06:03,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,288 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 9988 9991) the Hoare annotation is: true [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 9988 9991) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2022-07-12 11:06:04,288 INFO L899 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2022-07-12 11:06:04,289 INFO L895 garLoopResultBuilder]: At program point L9990-4(line 9990) the Hoare annotation is: (let ((.cse0 (or (= (select (select |#memory_$Pointer$.base| |aws_hash_table_is_valid_#in~map.base|) |aws_hash_table_is_valid_#in~map.offset|) 0) |aws_hash_table_is_valid_#t~short1284|)) (.cse1 (= aws_hash_table_is_valid_~map.offset |aws_hash_table_is_valid_#in~map.offset|)) (.cse2 (= |aws_hash_table_is_valid_#in~map.base| aws_hash_table_is_valid_~map.base))) (or (and (<= |aws_hash_table_is_valid_#in~map.base| 0) .cse0 (<= 0 |aws_hash_table_is_valid_#in~map.base|) .cse1 .cse2) (not (< 0 |#StackHeapBarrier|)) (let ((.cse7 (= (select (select |#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)) (.cse4 (= 0 (select (select |#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (let ((.cse3 (or (not .cse7) (not .cse4)))) (and (or (and .cse3 |aws_hash_table_is_valid_#t~short1284|) (and (not |aws_hash_table_is_valid_#t~short1284|) .cse4)) .cse0 .cse1 .cse2 (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (let ((.cse5 (select (select |#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset))) (and (= |aws_hash_table_is_valid_#t~mem1282.offset| .cse5) (= (select (select |#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) |aws_hash_table_is_valid_#t~mem1282.base|) (not (= 0 .cse5))))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (let ((.cse6 (select (select |#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset))) (and (not (= .cse6 0)) (= |aws_hash_table_is_valid_#t~mem1282.offset| (select (select |#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)) (= .cse6 |aws_hash_table_is_valid_#t~mem1282.base|))))) (or (and (not |aws_hash_table_is_valid_#t~short1281|) .cse7 .cse4) (and .cse3 |aws_hash_table_is_valid_#t~short1281|))))))) [2022-07-12 11:06:04,289 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 9988 9991) no Hoare annotation was computed. [2022-07-12 11:06:04,289 INFO L899 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2022-07-12 11:06:04,289 INFO L902 garLoopResultBuilder]: At program point L9140(line 9140) the Hoare annotation is: true [2022-07-12 11:06:04,289 INFO L902 garLoopResultBuilder]: At program point L9140-1(line 9140) the Hoare annotation is: true [2022-07-12 11:06:04,289 INFO L899 garLoopResultBuilder]: For program point L9140-2(line 9140) no Hoare annotation was computed. [2022-07-12 11:06:04,289 INFO L902 garLoopResultBuilder]: At program point L9640-3(line 9640) the Hoare annotation is: true [2022-07-12 11:06:04,289 INFO L899 garLoopResultBuilder]: For program point L9640-4(line 9640) no Hoare annotation was computed. [2022-07-12 11:06:04,289 INFO L902 garLoopResultBuilder]: At program point L9640-5(lines 9603 9641) the Hoare annotation is: true [2022-07-12 11:06:04,289 INFO L899 garLoopResultBuilder]: For program point L9640-6(lines 9603 9641) no Hoare annotation was computed. [2022-07-12 11:06:04,289 INFO L899 garLoopResultBuilder]: For program point L9640(line 9640) no Hoare annotation was computed. [2022-07-12 11:06:04,291 INFO L899 garLoopResultBuilder]: For program point L9640-1(line 9640) no Hoare annotation was computed. [2022-07-12 11:06:04,291 INFO L902 garLoopResultBuilder]: At program point L9604(line 9604) the Hoare annotation is: true [2022-07-12 11:06:04,291 INFO L902 garLoopResultBuilder]: At program point L9604-1(line 9604) the Hoare annotation is: true [2022-07-12 11:06:04,291 INFO L899 garLoopResultBuilder]: For program point L9604-2(line 9604) no Hoare annotation was computed. [2022-07-12 11:06:04,291 INFO L899 garLoopResultBuilder]: For program point L9629(lines 9629 9631) no Hoare annotation was computed. [2022-07-12 11:06:04,291 INFO L899 garLoopResultBuilder]: For program point L9142-1(line 9142) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9621(lines 9621 9623) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9142-2(line 9142) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9142-3(line 9142) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9142-5(line 9142) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9142-6(line 9142) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point s_remove_entryENTRY(lines 9603 9641) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9617-2(lines 9617 9636) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9142-8(line 9142) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9605(line 9605) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9605-1(line 9605) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9139(lines 9139 9143) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point s_remove_entryEXIT(lines 9603 9641) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9639-2(lines 9603 9641) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L902 garLoopResultBuilder]: At program point L9606-2(line 9606) the Hoare annotation is: true [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9606-3(line 9606) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9639(line 9639) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9606(line 9606) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point L9639-1(line 9639) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-12 11:06:04,292 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-12 11:06:04,296 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-12 11:06:04,296 INFO L902 garLoopResultBuilder]: At program point L10108(line 10108) the Hoare annotation is: true [2022-07-12 11:06:04,296 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10101 10113) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,296 INFO L899 garLoopResultBuilder]: For program point L10108-1(line 10108) no Hoare annotation was computed. [2022-07-12 11:06:04,296 INFO L899 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2022-07-12 11:06:04,296 INFO L895 garLoopResultBuilder]: At program point L10104(line 10104) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-12 11:06:04,296 INFO L899 garLoopResultBuilder]: For program point L10104-1(line 10104) no Hoare annotation was computed. [2022-07-12 11:06:04,296 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10101 10113) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10101 10113) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10075(lines 10075 10088) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10079(line 10079) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10069(lines 10069 10073) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L902 garLoopResultBuilder]: At program point aws_hash_iter_is_validENTRY(lines 10052 10093) the Hoare annotation is: true [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10059(lines 10059 10063) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10082(lines 10082 10083) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10076(line 10076) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10082-2(lines 10082 10083) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_is_validEXIT(lines 10052 10093) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L895 garLoopResultBuilder]: At program point L10064(line 10064) the Hoare annotation is: (or (and (= |aws_hash_iter_is_valid_#in~iter.base| 0) (= aws_hash_iter_is_valid_~iter.base |aws_hash_iter_is_valid_#in~iter.base|)) (not (< 0 |#StackHeapBarrier|))) [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10064-1(lines 10064 10068) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10085(line 10085) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10087-2(line 10087) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_is_validFINAL(lines 10052 10093) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10087(line 10087) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L10054(lines 10054 10058) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-12 11:06:04,297 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,298 INFO L902 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: true [2022-07-12 11:06:04,298 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 9999 10046) the Hoare annotation is: true [2022-07-12 11:06:04,298 INFO L902 garLoopResultBuilder]: At program point L10027(line 10027) the Hoare annotation is: true [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point L10027-1(line 10027) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 9999 10046) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 9999 10046) no Hoare annotation was computed. [2022-07-12 11:06:04,298 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-12 11:06:04,299 INFO L902 garLoopResultBuilder]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-12 11:06:04,299 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-12 11:06:04,299 INFO L902 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: true [2022-07-12 11:06:04,299 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,299 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-12 11:06:04,299 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9883(lines 9883 9885) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point L9887(line 9887) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9887-1(line 9887) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9883-2(lines 9883 9885) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point L9900(line 9900) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9900-1(line 9900) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9892(line 9892) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9892-2(lines 9892 9894) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point L9884(line 9884) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_deleteFINAL(lines 9871 9904) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9884-1(line 9884) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9892-4(lines 9892 9894) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point L9876(line 9876) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point L9876-1(line 9876) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9876-2(line 9876) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point aws_hash_iter_deleteENTRY(lines 9871 9904) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_deleteEXIT(lines 9871 9904) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L902 garLoopResultBuilder]: At program point L9877(line 9877) the Hoare annotation is: true [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9877-1(line 9877) no Hoare annotation was computed. [2022-07-12 11:06:04,300 INFO L899 garLoopResultBuilder]: For program point L9882(lines 9882 9889) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L9886(lines 9886 9888) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L902 garLoopResultBuilder]: At program point L9874(line 9874) the Hoare annotation is: true [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L9882-1(lines 9882 9889) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L9903-2(line 9903) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L9874-1(line 9874) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L902 garLoopResultBuilder]: At program point L9903(line 9903) the Hoare annotation is: true [2022-07-12 11:06:04,301 INFO L902 garLoopResultBuilder]: At program point L9903-1(line 9903) the Hoare annotation is: true [2022-07-12 11:06:04,301 INFO L902 garLoopResultBuilder]: At program point L9891(line 9891) the Hoare annotation is: true [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L9891-1(line 9891) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: false [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-07-12 11:06:04,301 INFO L895 garLoopResultBuilder]: At program point L10127(line 10127) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (< 1 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,301 INFO L899 garLoopResultBuilder]: For program point L10127-1(line 10127) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L10119-2(line 10119) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L10119-3(line 10119) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L10119(line 10119) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L10132(line 10132) the Hoare annotation is: false [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L10132-1(line 10132) the Hoare annotation is: false [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L10132-2(line 10132) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L10128(line 10128) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (< 1 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L10128-1(line 10128) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= 0 |ULTIMATE.start_aws_hash_iter_delete_harness_#t~ret1341#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L10128-2(line 10128) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L10120-3(line 10120) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L899 garLoopResultBuilder]: For program point L10120(line 10120) no Hoare annotation was computed. [2022-07-12 11:06:04,302 INFO L895 garLoopResultBuilder]: At program point L10120-2(line 10120) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L10130(line 10130) the Hoare annotation is: false [2022-07-12 11:06:04,303 INFO L902 garLoopResultBuilder]: At program point L10134(line 10134) the Hoare annotation is: true [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L10130-1(line 10130) the Hoare annotation is: false [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L10130-2(line 10130) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L10118-1(line 10118) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L10118-2(line 10118) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L10114(lines 10114 10133) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L895 garLoopResultBuilder]: At program point L10118(line 10118) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:06:04,303 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:06:04,304 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-12 11:06:04,306 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:06:04,307 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:06:04,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:06:04 BoogieIcfgContainer [2022-07-12 11:06:04,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:06:04,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:06:04,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:06:04,319 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:06:04,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:05:47" (3/4) ... [2022-07-12 11:06:04,320 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_remove_entry [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-12 11:06:04,324 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_is_valid [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_delete [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 11:06:04,325 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-12 11:06:04,334 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2022-07-12 11:06:04,334 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 75 nodes and edges [2022-07-12 11:06:04,335 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-12 11:06:04,336 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 11:06:04,337 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 11:06:04,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 11:06:04,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 11:06:04,339 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 11:06:04,616 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 11:06:04,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:06:04,617 INFO L158 Benchmark]: Toolchain (without parser) took 20108.41ms. Allocated memory was 123.7MB in the beginning and 293.6MB in the end (delta: 169.9MB). Free memory was 80.9MB in the beginning and 71.8MB in the end (delta: 9.2MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,617 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:06:04,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1954.89ms. Allocated memory was 123.7MB in the beginning and 188.7MB in the end (delta: 65.0MB). Free memory was 80.9MB in the beginning and 116.9MB in the end (delta: -36.0MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.47ms. Allocated memory is still 188.7MB. Free memory was 116.9MB in the beginning and 105.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,618 INFO L158 Benchmark]: Boogie Preprocessor took 79.10ms. Allocated memory is still 188.7MB. Free memory was 105.4MB in the beginning and 98.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,618 INFO L158 Benchmark]: RCFGBuilder took 1002.15ms. Allocated memory is still 188.7MB. Free memory was 98.0MB in the beginning and 110.9MB in the end (delta: -12.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,618 INFO L158 Benchmark]: TraceAbstraction took 16615.71ms. Allocated memory was 188.7MB in the beginning and 293.6MB in the end (delta: 104.9MB). Free memory was 109.9MB in the beginning and 196.5MB in the end (delta: -86.6MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,618 INFO L158 Benchmark]: Witness Printer took 297.69ms. Allocated memory is still 293.6MB. Free memory was 196.5MB in the beginning and 71.8MB in the end (delta: 124.8MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2022-07-12 11:06:04,619 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.14ms. Allocated memory is still 83.9MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1954.89ms. Allocated memory was 123.7MB in the beginning and 188.7MB in the end (delta: 65.0MB). Free memory was 80.9MB in the beginning and 116.9MB in the end (delta: -36.0MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.47ms. Allocated memory is still 188.7MB. Free memory was 116.9MB in the beginning and 105.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.10ms. Allocated memory is still 188.7MB. Free memory was 105.4MB in the beginning and 98.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1002.15ms. Allocated memory is still 188.7MB. Free memory was 98.0MB in the beginning and 110.9MB in the end (delta: -12.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16615.71ms. Allocated memory was 188.7MB in the beginning and 293.6MB in the end (delta: 104.9MB). Free memory was 109.9MB in the beginning and 196.5MB in the end (delta: -86.6MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. * Witness Printer took 297.69ms. Allocated memory is still 293.6MB. Free memory was 196.5MB in the beginning and 71.8MB in the end (delta: 124.8MB). Peak memory consumption was 123.7MB. 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 210 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 897 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 845 mSDsluCounter, 5690 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 399 IncrementalHoareTripleChecker+Unchecked, 4112 mSDsCounter, 516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3006 IncrementalHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 516 mSolverCounterUnsat, 1578 mSDtfsCounter, 3006 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1697 GetRequests, 1618 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=6, InterpolantAutomatonStates: 55, 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, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 605 PreInvPairs, 631 NumberOfFragments, 775 HoareAnnotationTreeSize, 605 FomulaSimplifications, 35 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 82 FomulaSimplificationsInter, 433 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2357 ConstructedInterpolants, 5 QuantifiedInterpolants, 3575 SizeOfPredicates, 15 NumberOfNonLiveVariables, 12922 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 7655/7737 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: ((!(map == 0) && map == map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: ((!(map == 0) && map == map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 10134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9617]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 11:06:04,643 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: TRUE