./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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_table_clean_up_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 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:58:25,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:58:25,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:58:25,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:58:25,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:58:25,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:58:25,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:58:25,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:58:25,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:58:25,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:58:25,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:58:25,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:58:25,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:58:25,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:58:25,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:58:25,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:58:25,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:58:25,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:58:25,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:58:25,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:58:25,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:58:25,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:58:25,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:58:25,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:58:25,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:58:25,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:58:25,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:58:25,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:58:25,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:58:25,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:58:25,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:58:25,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:58:25,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:58:25,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:58:25,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:58:25,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:58:25,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:58:25,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:58:25,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:58:25,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:58:25,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:58:25,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 10:58:25,432 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:58:25,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:58:25,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:58:25,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:58:25,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:58:25,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:58:25,435 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:58:25,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:58:25,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:58:25,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:58:25,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:58:25,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:58:25,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:58:25,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:58:25,437 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:58:25,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:58:25,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:58:25,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:58:25,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:58:25,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:58:25,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:58:25,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:58:25,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:58:25,439 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 -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2021-11-06 10:58:25,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:58:25,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:58:25,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:58:25,619 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:58:25,620 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:58:25,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-06 10:58:25,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f3c0772/6f5b875d78154935826872a1891cea0a/FLAGc1f976ead [2021-11-06 10:58:26,287 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:58:26,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2021-11-06 10:58:26,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f3c0772/6f5b875d78154935826872a1891cea0a/FLAGc1f976ead [2021-11-06 10:58:26,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f3c0772/6f5b875d78154935826872a1891cea0a [2021-11-06 10:58:26,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:58:26,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:58:26,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:58:26,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:58:26,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:58:26,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:58:26" (1/1) ... [2021-11-06 10:58:26,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48aff2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:26, skipping insertion in model container [2021-11-06 10:58:26,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:58:26" (1/1) ... [2021-11-06 10:58:26,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:58:26,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:58:26,784 WARN L228 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_table_clean_up_harness.i[4497,4510] [2021-11-06 10:58:26,793 WARN L228 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_table_clean_up_harness.i[4557,4570] [2021-11-06 10:58:26,817 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:58:26,822 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:58:27,729 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,734 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,734 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,735 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,736 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,745 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,746 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,747 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,750 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,751 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,752 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,755 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,755 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:27,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:58:27,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:58:27,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:58:27,995 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:58:27,996 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:58:27,997 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:58:27,997 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:58:27,998 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:58:27,998 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:58:27,999 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:58:28,102 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:58:28,381 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,382 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,407 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,408 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,412 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,413 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,429 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,430 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,432 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,432 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,432 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:58:28,501 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:58:28,520 WARN L228 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_table_clean_up_harness.i[4497,4510] [2021-11-06 10:58:28,521 WARN L228 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_table_clean_up_harness.i[4557,4570] [2021-11-06 10:58:28,522 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:58:28,524 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:58:28,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,570 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,570 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,577 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,578 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,578 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:58:28,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:58:28,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:58:28,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:58:28,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:58:28,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:58:28,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:58:28,603 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:58:28,603 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:58:28,603 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:58:28,624 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:58:28,731 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,732 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,736 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,737 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,738 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,738 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,747 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,748 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,748 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,749 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:58:28,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:58:28,946 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:58:28,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28 WrapperNode [2021-11-06 10:58:28,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:58:28,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:58:28,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:58:28,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:58:28,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:58:29,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:58:29,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:58:29,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:58:29,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:58:29,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:58:29,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:58:29,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:58:29,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (1/1) ... [2021-11-06 10:58:29,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:58:29,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:58:29,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 10:58:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 10:58:29,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-06 10:58:29,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:58:29,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:58:29,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:58:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:58:29,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:58:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-06 10:58:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:58:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-06 10:58:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:58:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:58:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:58:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:58:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:58:36,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:58:36,347 INFO L299 CfgBuilder]: Removed 144 assume(true) statements. [2021-11-06 10:58:36,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:58:36 BoogieIcfgContainer [2021-11-06 10:58:36,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:58:36,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:58:36,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:58:36,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:58:36,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:58:26" (1/3) ... [2021-11-06 10:58:36,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e6b615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:58:36, skipping insertion in model container [2021-11-06 10:58:36,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:58:28" (2/3) ... [2021-11-06 10:58:36,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e6b615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:58:36, skipping insertion in model container [2021-11-06 10:58:36,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:58:36" (3/3) ... [2021-11-06 10:58:36,355 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2021-11-06 10:58:36,358 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:58:36,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 10:58:36,394 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:58:36,401 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 10:58:36,401 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 10:58:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 149 states have internal predecessors, (201), 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) [2021-11-06 10:58:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 10:58:36,421 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:36,422 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:36,422 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 937862733, now seen corresponding path program 1 times [2021-11-06 10:58:36,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:36,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390985312] [2021-11-06 10:58:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:36,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:36,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:36,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390985312] [2021-11-06 10:58:36,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390985312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:36,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:36,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:58:36,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332000836] [2021-11-06 10:58:36,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:58:36,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:58:36,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:58:36,970 INFO L87 Difference]: Start difference. First operand has 150 states, 143 states have (on average 1.4055944055944056) internal successors, (201), 149 states have internal predecessors, (201), 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) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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) [2021-11-06 10:58:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:58:37,000 INFO L93 Difference]: Finished difference Result 296 states and 397 transitions. [2021-11-06 10:58:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:58:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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) Word has length 55 [2021-11-06 10:58:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:58:37,009 INFO L225 Difference]: With dead ends: 296 [2021-11-06 10:58:37,010 INFO L226 Difference]: Without dead ends: 144 [2021-11-06 10:58:37,012 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:58:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-06 10:58:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-06 10:58:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 143 states have internal predecessors, (171), 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) [2021-11-06 10:58:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2021-11-06 10:58:37,058 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 55 [2021-11-06 10:58:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:58:37,058 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2021-11-06 10:58:37,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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) [2021-11-06 10:58:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2021-11-06 10:58:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 10:58:37,060 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:37,061 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:37,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:58:37,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1984184949, now seen corresponding path program 1 times [2021-11-06 10:58:37,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:37,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451138125] [2021-11-06 10:58:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:37,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:37,152 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 10:58:37,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703968915] [2021-11-06 10:58:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:37,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:58:37,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:58:37,168 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) [2021-11-06 10:58:37,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 10:58:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:37,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 2472 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 10:58:37,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:58:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:38,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:38,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451138125] [2021-11-06 10:58:38,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 10:58:38,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703968915] [2021-11-06 10:58:38,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703968915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:38,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:38,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:58:38,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598908906] [2021-11-06 10:58:38,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:58:38,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:58:38,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:58:38,277 INFO L87 Difference]: Start difference. First operand 144 states and 171 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2021-11-06 10:58:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:58:38,389 INFO L93 Difference]: Finished difference Result 398 states and 474 transitions. [2021-11-06 10:58:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:58:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) Word has length 55 [2021-11-06 10:58:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:58:38,391 INFO L225 Difference]: With dead ends: 398 [2021-11-06 10:58:38,391 INFO L226 Difference]: Without dead ends: 276 [2021-11-06 10:58:38,392 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:58:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-06 10:58:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 147. [2021-11-06 10:58:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 146 states have internal predecessors, (174), 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) [2021-11-06 10:58:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2021-11-06 10:58:38,399 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 55 [2021-11-06 10:58:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:58:38,399 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2021-11-06 10:58:38,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2021-11-06 10:58:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2021-11-06 10:58:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 10:58:38,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:38,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:38,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 10:58:38,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:58:38,623 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1945028463, now seen corresponding path program 1 times [2021-11-06 10:58:38,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:38,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756255176] [2021-11-06 10:58:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:38,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:39,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:39,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756255176] [2021-11-06 10:58:39,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756255176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:39,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:39,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:58:39,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067072773] [2021-11-06 10:58:39,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:58:39,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:58:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:58:39,100 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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) [2021-11-06 10:58:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:58:44,212 INFO L93 Difference]: Finished difference Result 262 states and 311 transitions. [2021-11-06 10:58:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:58:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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) Word has length 57 [2021-11-06 10:58:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:58:44,214 INFO L225 Difference]: With dead ends: 262 [2021-11-06 10:58:44,214 INFO L226 Difference]: Without dead ends: 153 [2021-11-06 10:58:44,215 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:58:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-06 10:58:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2021-11-06 10:58:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 148 states have internal predecessors, (176), 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) [2021-11-06 10:58:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2021-11-06 10:58:44,226 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 57 [2021-11-06 10:58:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:58:44,227 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2021-11-06 10:58:44,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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) [2021-11-06 10:58:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2021-11-06 10:58:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 10:58:44,230 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:44,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:44,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:58:44,233 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1101022961, now seen corresponding path program 1 times [2021-11-06 10:58:44,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:44,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133040709] [2021-11-06 10:58:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:44,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:44,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:44,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133040709] [2021-11-06 10:58:44,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133040709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:44,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:44,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:58:44,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757373869] [2021-11-06 10:58:44,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:58:44,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:58:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:58:44,498 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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) [2021-11-06 10:58:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:58:44,612 INFO L93 Difference]: Finished difference Result 261 states and 309 transitions. [2021-11-06 10:58:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:58:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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) Word has length 57 [2021-11-06 10:58:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:58:44,614 INFO L225 Difference]: With dead ends: 261 [2021-11-06 10:58:44,614 INFO L226 Difference]: Without dead ends: 147 [2021-11-06 10:58:44,614 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:58:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-06 10:58:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-11-06 10:58:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 146 states have internal predecessors, (172), 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) [2021-11-06 10:58:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2021-11-06 10:58:44,621 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 57 [2021-11-06 10:58:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:58:44,621 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2021-11-06 10:58:44,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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) [2021-11-06 10:58:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2021-11-06 10:58:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 10:58:44,622 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:44,622 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:44,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:58:44,623 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2001669686, now seen corresponding path program 1 times [2021-11-06 10:58:44,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:44,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489531650] [2021-11-06 10:58:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:44,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:44,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:44,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489531650] [2021-11-06 10:58:44,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489531650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:44,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:44,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:58:44,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409255590] [2021-11-06 10:58:44,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:58:44,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:58:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:58:44,887 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) [2021-11-06 10:58:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:58:49,764 INFO L93 Difference]: Finished difference Result 260 states and 305 transitions. [2021-11-06 10:58:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:58:49,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) Word has length 59 [2021-11-06 10:58:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:58:49,766 INFO L225 Difference]: With dead ends: 260 [2021-11-06 10:58:49,766 INFO L226 Difference]: Without dead ends: 150 [2021-11-06 10:58:49,767 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:58:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-06 10:58:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2021-11-06 10:58:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.1914893617021276) internal successors, (168), 146 states have internal predecessors, (168), 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) [2021-11-06 10:58:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2021-11-06 10:58:49,773 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 59 [2021-11-06 10:58:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:58:49,774 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2021-11-06 10:58:49,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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) [2021-11-06 10:58:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2021-11-06 10:58:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 10:58:49,775 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:49,775 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:49,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:58:49,775 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1973786693, now seen corresponding path program 1 times [2021-11-06 10:58:49,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:49,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513397550] [2021-11-06 10:58:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:49,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:50,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:50,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513397550] [2021-11-06 10:58:50,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513397550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:50,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:50,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:58:50,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807030558] [2021-11-06 10:58:50,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:58:50,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:58:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:58:50,455 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2021-11-06 10:58:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:58:55,454 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2021-11-06 10:58:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:58:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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) Word has length 60 [2021-11-06 10:58:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:58:55,456 INFO L225 Difference]: With dead ends: 161 [2021-11-06 10:58:55,456 INFO L226 Difference]: Without dead ends: 157 [2021-11-06 10:58:55,456 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:58:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-06 10:58:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2021-11-06 10:58:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 142 states have internal predecessors, (164), 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) [2021-11-06 10:58:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2021-11-06 10:58:55,471 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 60 [2021-11-06 10:58:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:58:55,471 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2021-11-06 10:58:55,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2021-11-06 10:58:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2021-11-06 10:58:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 10:58:55,472 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:58:55,472 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:58:55,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:58:55,473 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:58:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:58:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1344954047, now seen corresponding path program 1 times [2021-11-06 10:58:55,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:58:55,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054752124] [2021-11-06 10:58:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:58:55,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:58:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:58:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:58:57,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:58:57,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054752124] [2021-11-06 10:58:57,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054752124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:58:57,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:58:57,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 10:58:57,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952869940] [2021-11-06 10:58:57,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 10:58:57,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:58:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 10:58:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-11-06 10:58:57,748 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 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) [2021-11-06 10:59:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:24,101 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2021-11-06 10:59:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-06 10:59:24,102 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 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) Word has length 66 [2021-11-06 10:59:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:24,103 INFO L225 Difference]: With dead ends: 174 [2021-11-06 10:59:24,103 INFO L226 Difference]: Without dead ends: 164 [2021-11-06 10:59:24,103 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2021-11-06 10:59:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-06 10:59:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2021-11-06 10:59:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 142 states have internal predecessors, (163), 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) [2021-11-06 10:59:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2021-11-06 10:59:24,110 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 66 [2021-11-06 10:59:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:24,110 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2021-11-06 10:59:24,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 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) [2021-11-06 10:59:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2021-11-06 10:59:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 10:59:24,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:24,111 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:24,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:59:24,111 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1471234926, now seen corresponding path program 1 times [2021-11-06 10:59:24,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:24,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154355894] [2021-11-06 10:59:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:24,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:59:24,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:59:24,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154355894] [2021-11-06 10:59:24,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154355894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:59:24,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:59:24,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:59:24,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382345767] [2021-11-06 10:59:24,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:59:24,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:59:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:59:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:59:24,413 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) [2021-11-06 10:59:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:29,229 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2021-11-06 10:59:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:59:29,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) Word has length 71 [2021-11-06 10:59:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:29,230 INFO L225 Difference]: With dead ends: 215 [2021-11-06 10:59:29,230 INFO L226 Difference]: Without dead ends: 143 [2021-11-06 10:59:29,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:59:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-06 10:59:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-06 10:59:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 142 states have internal predecessors, (162), 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) [2021-11-06 10:59:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2021-11-06 10:59:29,237 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 71 [2021-11-06 10:59:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:29,238 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2021-11-06 10:59:29,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) [2021-11-06 10:59:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2021-11-06 10:59:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:59:29,238 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:29,239 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:29,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:59:29,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1507166216, now seen corresponding path program 1 times [2021-11-06 10:59:29,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:29,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077231363] [2021-11-06 10:59:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:29,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:59:29,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:59:29,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077231363] [2021-11-06 10:59:29,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077231363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:59:29,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:59:29,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:59:29,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661759411] [2021-11-06 10:59:29,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:59:29,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:59:29,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:59:29,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:59:29,680 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) [2021-11-06 10:59:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:32,511 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2021-11-06 10:59:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:59:32,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) Word has length 76 [2021-11-06 10:59:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:32,513 INFO L225 Difference]: With dead ends: 233 [2021-11-06 10:59:32,513 INFO L226 Difference]: Without dead ends: 159 [2021-11-06 10:59:32,513 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:59:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-06 10:59:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-11-06 10:59:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.1608391608391608) internal successors, (166), 146 states have internal predecessors, (166), 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) [2021-11-06 10:59:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2021-11-06 10:59:32,518 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 76 [2021-11-06 10:59:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:32,519 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2021-11-06 10:59:32,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) [2021-11-06 10:59:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2021-11-06 10:59:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 10:59:32,546 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:32,547 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:32,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:59:32,547 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1309389368, now seen corresponding path program 1 times [2021-11-06 10:59:32,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:32,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523696670] [2021-11-06 10:59:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:32,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:59:32,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:59:32,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523696670] [2021-11-06 10:59:32,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523696670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:59:32,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:59:32,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:59:32,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140699112] [2021-11-06 10:59:32,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:59:32,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:59:32,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:59:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:59:32,930 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2021-11-06 10:59:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:33,291 INFO L93 Difference]: Finished difference Result 224 states and 253 transitions. [2021-11-06 10:59:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:59:33,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) Word has length 76 [2021-11-06 10:59:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:33,292 INFO L225 Difference]: With dead ends: 224 [2021-11-06 10:59:33,292 INFO L226 Difference]: Without dead ends: 143 [2021-11-06 10:59:33,292 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:59:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-06 10:59:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-11-06 10:59:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.1366906474820144) internal successors, (158), 142 states have internal predecessors, (158), 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) [2021-11-06 10:59:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2021-11-06 10:59:33,299 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 76 [2021-11-06 10:59:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:33,299 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2021-11-06 10:59:33,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2021-11-06 10:59:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2021-11-06 10:59:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-06 10:59:33,300 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:33,300 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:33,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:59:33,301 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -630391455, now seen corresponding path program 1 times [2021-11-06 10:59:33,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:33,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653379546] [2021-11-06 10:59:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:33,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:59:33,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:59:33,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653379546] [2021-11-06 10:59:33,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653379546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:59:33,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:59:33,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 10:59:33,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115845892] [2021-11-06 10:59:33,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 10:59:33,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:59:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 10:59:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:59:33,485 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2021-11-06 10:59:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:33,510 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2021-11-06 10:59:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 10:59:33,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 82 [2021-11-06 10:59:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:33,511 INFO L225 Difference]: With dead ends: 191 [2021-11-06 10:59:33,511 INFO L226 Difference]: Without dead ends: 144 [2021-11-06 10:59:33,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 10:59:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-06 10:59:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-06 10:59:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 143 states have internal predecessors, (159), 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) [2021-11-06 10:59:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2021-11-06 10:59:33,518 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 82 [2021-11-06 10:59:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:33,519 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2021-11-06 10:59:33,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2021-11-06 10:59:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2021-11-06 10:59:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-06 10:59:33,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:33,520 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:33,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:59:33,520 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1144615907, now seen corresponding path program 1 times [2021-11-06 10:59:33,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:33,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530341253] [2021-11-06 10:59:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:33,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:59:33,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:59:33,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530341253] [2021-11-06 10:59:33,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530341253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:59:33,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:59:33,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:59:33,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793714749] [2021-11-06 10:59:33,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:59:33,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:59:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:59:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:59:33,928 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2021-11-06 10:59:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:34,018 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2021-11-06 10:59:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:59:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) Word has length 82 [2021-11-06 10:59:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:34,020 INFO L225 Difference]: With dead ends: 144 [2021-11-06 10:59:34,020 INFO L226 Difference]: Without dead ends: 142 [2021-11-06 10:59:34,020 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:59:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-06 10:59:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-11-06 10:59:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 139 states have (on average 1.129496402877698) internal successors, (157), 141 states have internal predecessors, (157), 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) [2021-11-06 10:59:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2021-11-06 10:59:34,025 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 82 [2021-11-06 10:59:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:34,025 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2021-11-06 10:59:34,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2021-11-06 10:59:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2021-11-06 10:59:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 10:59:34,026 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:34,026 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:34,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:59:34,028 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 464392901, now seen corresponding path program 1 times [2021-11-06 10:59:34,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:34,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878961480] [2021-11-06 10:59:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:34,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:59:35,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:59:35,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878961480] [2021-11-06 10:59:35,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878961480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:59:35,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:59:35,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:59:35,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409380481] [2021-11-06 10:59:35,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:59:35,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:59:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:59:35,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:59:35,103 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2021-11-06 10:59:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:59:35,261 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2021-11-06 10:59:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:59:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) Word has length 84 [2021-11-06 10:59:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:59:35,263 INFO L225 Difference]: With dead ends: 259 [2021-11-06 10:59:35,263 INFO L226 Difference]: Without dead ends: 142 [2021-11-06 10:59:35,263 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:59:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-06 10:59:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2021-11-06 10:59:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 136 states have (on average 1.1176470588235294) internal successors, (152), 138 states have internal predecessors, (152), 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) [2021-11-06 10:59:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2021-11-06 10:59:35,269 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 84 [2021-11-06 10:59:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:59:35,269 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2021-11-06 10:59:35,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) [2021-11-06 10:59:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2021-11-06 10:59:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 10:59:35,270 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:59:35,270 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:59:35,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:59:35,270 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 10:59:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:59:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1560379032, now seen corresponding path program 1 times [2021-11-06 10:59:35,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:59:35,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920399073] [2021-11-06 10:59:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:35,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:59:35,324 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 10:59:35,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704105424] [2021-11-06 10:59:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:59:35,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 10:59:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:59:35,325 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) [2021-11-06 10:59:35,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 10:59:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:59:37,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 139 conjunts are in the unsatisfiable core [2021-11-06 10:59:37,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 10:59:37,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 10:59:38,131 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-06 10:59:38,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 53 [2021-11-06 10:59:39,053 INFO L354 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2021-11-06 10:59:39,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 41 [2021-11-06 10:59:39,860 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-06 10:59:39,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 45 [2021-11-06 10:59:40,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 10:59:40,842 INFO L354 Elim1Store]: treesize reduction 66, result has 32.7 percent of original size [2021-11-06 10:59:40,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 58 [2021-11-06 10:59:41,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-06 10:59:41,668 INFO L354 Elim1Store]: treesize reduction 156, result has 17.5 percent of original size [2021-11-06 10:59:41,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 75 treesize of output 92 [2021-11-06 10:59:42,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-06 10:59:57,786 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 10:59:57,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2021-11-06 10:59:57,841 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-06 10:59:57,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 91 [2021-11-06 11:00:01,237 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-11-06 11:00:01,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 95 [2021-11-06 11:00:01,288 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-06 11:00:01,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2021-11-06 11:00:04,212 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 11:00:04,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 118 [2021-11-06 11:00:04,302 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-11-06 11:00:04,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 129 [2021-11-06 11:00:04,535 INFO L354 Elim1Store]: treesize reduction 88, result has 37.6 percent of original size [2021-11-06 11:00:04,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 143 [2021-11-06 11:00:05,577 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-06 11:00:05,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 51 [2021-11-06 11:00:05,637 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-11-06 11:00:05,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 47 [2021-11-06 11:00:07,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-11-06 11:00:07,273 INFO L354 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2021-11-06 11:00:07,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 41 [2021-11-06 11:00:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 11:00:07,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:00:07,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920399073] [2021-11-06 11:00:07,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:00:07,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704105424] [2021-11-06 11:00:07,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704105424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:00:07,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:00:07,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-06 11:00:07,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630305650] [2021-11-06 11:00:07,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-06 11:00:07,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:00:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-06 11:00:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-11-06 11:00:07,428 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 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) [2021-11-06 11:00:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:00:51,535 INFO L93 Difference]: Finished difference Result 304 states and 327 transitions. [2021-11-06 11:00:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-06 11:00:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 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) Word has length 87 [2021-11-06 11:00:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:00:51,540 INFO L225 Difference]: With dead ends: 304 [2021-11-06 11:00:51,540 INFO L226 Difference]: Without dead ends: 259 [2021-11-06 11:00:51,541 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2021-11-06 11:00:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-06 11:00:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 178. [2021-11-06 11:00:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.0971428571428572) internal successors, (192), 177 states have internal predecessors, (192), 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) [2021-11-06 11:00:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2021-11-06 11:00:51,553 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 87 [2021-11-06 11:00:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:00:51,554 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2021-11-06 11:00:51,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 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) [2021-11-06 11:00:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2021-11-06 11:00:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 11:00:51,554 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:00:51,554 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:00:51,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-06 11:00:51,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-06 11:00:51,768 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 11:00:51,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:00:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash -378783014, now seen corresponding path program 1 times [2021-11-06 11:00:51,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:00:51,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773266848] [2021-11-06 11:00:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:00:51,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:00:51,823 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:00:51,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421210226] [2021-11-06 11:00:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:00:51,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:00:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:00:51,824 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) [2021-11-06 11:00:51,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 11:03:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:03:56,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 358 conjunts are in the unsatisfiable core [2021-11-06 11:03:56,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:03:56,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-06 11:03:57,054 INFO L354 Elim1Store]: treesize reduction 133, result has 15.3 percent of original size [2021-11-06 11:03:57,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 53 [2021-11-06 11:03:57,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 11:03:58,335 INFO L354 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2021-11-06 11:03:58,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 41 [2021-11-06 11:03:58,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-06 11:03:59,610 INFO L354 Elim1Store]: treesize reduction 78, result has 20.4 percent of original size [2021-11-06 11:03:59,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 63 [2021-11-06 11:04:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 11:04:01,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:04:01,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773266848] [2021-11-06 11:04:01,380 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:04:01,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421210226] [2021-11-06 11:04:01,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421210226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:04:01,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:04:01,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 11:04:01,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26658974] [2021-11-06 11:04:01,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 11:04:01,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:04:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 11:04:01,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-06 11:04:01,382 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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) [2021-11-06 11:04:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:04:22,757 INFO L93 Difference]: Finished difference Result 347 states and 374 transitions. [2021-11-06 11:04:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 11:04:22,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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) Word has length 87 [2021-11-06 11:04:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:04:22,758 INFO L225 Difference]: With dead ends: 347 [2021-11-06 11:04:22,758 INFO L226 Difference]: Without dead ends: 188 [2021-11-06 11:04:22,759 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-11-06 11:04:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-06 11:04:22,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2021-11-06 11:04:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 180 states have (on average 1.0944444444444446) internal successors, (197), 182 states have internal predecessors, (197), 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) [2021-11-06 11:04:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2021-11-06 11:04:22,769 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 87 [2021-11-06 11:04:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:04:22,769 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2021-11-06 11:04:22,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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) [2021-11-06 11:04:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2021-11-06 11:04:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 11:04:22,770 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:04:22,770 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:04:22,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 11:04:22,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:04:22,984 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 11:04:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:04:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash -245451586, now seen corresponding path program 1 times [2021-11-06 11:04:22,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:04:22,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120691686] [2021-11-06 11:04:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:04:22,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:04:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:04:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 11:04:23,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:04:23,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120691686] [2021-11-06 11:04:23,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120691686] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:04:23,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:04:23,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 11:04:23,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445827071] [2021-11-06 11:04:23,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:04:23,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:04:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:04:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:04:23,264 INFO L87 Difference]: Start difference. First operand 183 states and 197 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) [2021-11-06 11:04:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:04:23,460 INFO L93 Difference]: Finished difference Result 344 states and 370 transitions. [2021-11-06 11:04:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:04:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) Word has length 89 [2021-11-06 11:04:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:04:23,461 INFO L225 Difference]: With dead ends: 344 [2021-11-06 11:04:23,462 INFO L226 Difference]: Without dead ends: 176 [2021-11-06 11:04:23,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 11:04:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-06 11:04:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-11-06 11:04:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 173 states have (on average 1.0867052023121386) internal successors, (188), 175 states have internal predecessors, (188), 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) [2021-11-06 11:04:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2021-11-06 11:04:23,478 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 89 [2021-11-06 11:04:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:04:23,479 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2021-11-06 11:04:23,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) [2021-11-06 11:04:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2021-11-06 11:04:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 11:04:23,479 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 11:04:23,479 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:04:23,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 11:04:23,480 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 11:04:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 11:04:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1294211146, now seen corresponding path program 1 times [2021-11-06 11:04:23,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 11:04:23,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160844992] [2021-11-06 11:04:23,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:04:23,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 11:04:23,578 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 11:04:23,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384444737] [2021-11-06 11:04:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 11:04:23,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 11:04:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 11:04:23,591 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) [2021-11-06 11:04:23,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 11:04:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 11:04:24,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 11:04:24,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 11:04:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 11:04:25,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 11:04:25,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160844992] [2021-11-06 11:04:25,002 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 11:04:25,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384444737] [2021-11-06 11:04:25,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384444737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 11:04:25,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 11:04:25,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 11:04:25,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969815049] [2021-11-06 11:04:25,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 11:04:25,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 11:04:25,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 11:04:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 11:04:25,004 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) [2021-11-06 11:04:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 11:04:25,138 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2021-11-06 11:04:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 11:04:25,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) Word has length 89 [2021-11-06 11:04:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 11:04:25,139 INFO L225 Difference]: With dead ends: 176 [2021-11-06 11:04:25,139 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 11:04:25,140 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 11:04:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 11:04:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 11:04:25,141 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) [2021-11-06 11:04:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 11:04:25,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-11-06 11:04:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 11:04:25,141 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 11:04:25,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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) [2021-11-06 11:04:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 11:04:25,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 11:04:25,144 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:04:25,145 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:04:25,145 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:04:25,145 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:04:25,145 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:04:25,145 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 11:04:25,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-06 11:04:25,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-06 11:04:25,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 11:04:25,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:25,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 11:04:32,238 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,238 INFO L857 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2021-11-06 11:04:32,238 INFO L857 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-11-06 11:04:32,238 INFO L857 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2021-11-06 11:04:32,238 INFO L857 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-06 11:04:32,238 INFO L853 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-06 11:04:32,238 INFO L857 garLoopResultBuilder]: For program point L7175(lines 1 10161) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L853 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse2 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse4 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse5 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse6 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse7 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse10 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse12 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse13 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse14 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse15 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse16 (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse18 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse19 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse20 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse21 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse9 .cse10 (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse11 (= .cse8 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) .cse12 (= .cse8 (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528)) .cse13 .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) .cse18 .cse19 .cse20 .cse21)) (and .cse0 .cse1 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L853 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: false [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L853 garLoopResultBuilder]: At program point L10017-6(lines 10015 10018) the Hoare annotation is: false [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-12(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L853 garLoopResultBuilder]: At program point L10017-13(lines 10015 10018) the Hoare annotation is: false [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-14(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-9(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-10(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L853 garLoopResultBuilder]: At program point L10017-20(lines 10015 10018) the Hoare annotation is: false [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-21(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-23(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-16(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-17(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,239 INFO L857 garLoopResultBuilder]: For program point L10017-19(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L10017-24(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L10017-26(line 10017) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L853 garLoopResultBuilder]: At program point L10017-27(lines 10015 10018) the Hoare annotation is: false [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L853 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: false [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L853 garLoopResultBuilder]: At program point L7411(lines 7397 7412) the Hoare annotation is: false [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,240 INFO L857 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L853 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse5 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse6 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse7 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse8 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse10 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse12 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse13 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse14 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse15 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse16 (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse18 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse19 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse20 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse21 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L857 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-06 11:04:32,241 INFO L853 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: false [2021-11-06 11:04:32,241 INFO L853 garLoopResultBuilder]: At program point L6852-1(line 6852) the Hoare annotation is: false [2021-11-06 11:04:32,241 INFO L853 garLoopResultBuilder]: At program point L6852(line 6852) the Hoare annotation is: false [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L853 garLoopResultBuilder]: At program point L7415(lines 7414 7416) the Hoare annotation is: false [2021-11-06 11:04:32,242 INFO L853 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-06 11:04:32,242 INFO L853 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L6822(lines 6822 6824) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L6822-2(lines 6822 6824) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L853 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= .cse0 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= .cse0 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L10028-1(lines 10028 10032) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L10028-2(lines 10028 10032) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L10028-3(lines 10028 10032) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L860 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2021-11-06 11:04:32,242 INFO L857 garLoopResultBuilder]: For program point L6825-2(lines 6825 6827) no Hoare annotation was computed. [2021-11-06 11:04:32,242 INFO L853 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L6825(lines 6825 6827) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: false [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L10131(lines 10131 10133) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse2 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse5 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse6 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse7 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse8 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse10 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse12 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse13 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse14 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse15 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse16 (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse18 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse19 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse20 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse21 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and .cse0 (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-11-06 11:04:32,243 INFO L853 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0)) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,243 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L9276-2(lines 9276 9278) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L10135(lines 10135 10137) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L853 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L853 garLoopResultBuilder]: At program point L10071-2(lines 10026 10073) the Hoare annotation is: false [2021-11-06 11:04:32,244 INFO L853 garLoopResultBuilder]: At program point L10071-3(lines 10026 10073) the Hoare annotation is: false [2021-11-06 11:04:32,244 INFO L857 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2021-11-06 11:04:32,244 INFO L853 garLoopResultBuilder]: At program point L10071(lines 10026 10073) the Hoare annotation is: false [2021-11-06 11:04:32,244 INFO L853 garLoopResultBuilder]: At program point L10071-1(lines 10026 10073) the Hoare annotation is: false [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: false [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L10139(lines 10128 10140) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse4 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse6 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and .cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse1 (exists ((|v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11| Int) (|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11|) 0))) (and (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0) (= (select |#valid| |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11|) 0) (= .cse2 (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528)) (= .cse2 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (not (= |v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|))))) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1) .cse3 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8) .cse4 (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) .cse5 .cse6 .cse7 (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L857 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse2 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|))) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0))) (.cse4 (= (select |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 1)) (.cse5 (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 1)) (.cse6 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse7 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|)) (.cse10 (<= (mod ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 18446744073709551616) 8)) (.cse11 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse12 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse13 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse14 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse15 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse16 (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8)) (.cse17 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1)) (.cse18 (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) (.cse19 (exists ((|v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6| Int)) (= (select |#valid| |v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6|) 0))) (.cse20 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse21 (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= .cse8 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse9 .cse10 (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse11 (= .cse8 ULTIMATE.start_aws_add_u64_checked_~a) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) .cse12 (= .cse8 (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528)) .cse13 .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) .cse18 .cse19 .cse20 .cse21)) (and .cse0 .cse1 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= 0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.base|) 1) (= ULTIMATE.start_ensure_allocated_hash_table_~map.offset |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0.offset|)) [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-06 11:04:32,245 INFO L853 garLoopResultBuilder]: At program point L266-2(line 266) the Hoare annotation is: false [2021-11-06 11:04:32,247 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 11:04:32,248 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 11:04:32,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,315 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,325 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,325 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:32 BoogieIcfgContainer [2021-11-06 11:04:32,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 11:04:32,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 11:04:32,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 11:04:32,327 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 11:04:32,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:58:36" (3/4) ... [2021-11-06 11:04:32,351 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 11:04:32,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 181 nodes and edges [2021-11-06 11:04:32,381 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2021-11-06 11:04:32,382 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-06 11:04:32,383 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-06 11:04:32,384 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-06 11:04:32,385 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-06 11:04:32,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-06 11:04:32,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 11:04:32,408 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) [2021-11-06 11:04:32,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) [2021-11-06 11:04:32,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) [2021-11-06 11:04:32,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) [2021-11-06 11:04:32,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 == map && required_bytes == 0) && !(map == 0)) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 : int, v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: (((\valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0 && \valid[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11] == 0) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == 24 * num_entries) && !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 == v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6))) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && max_table_entries == 8) && \valid[map] == 1) && map == map) && !(map == required_bytes)) && \result == 0) || (((((((0 == map && !(map == 0)) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && !(map == required_bytes)) [2021-11-06 11:04:32,409 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) [2021-11-06 11:04:32,410 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 == map && required_bytes == 0) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && required_bytes == required_bytes) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || (((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \result + 1 <= 0) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) [2021-11-06 11:04:32,411 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 == map && required_bytes == 0) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && required_bytes == required_bytes) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \result + 1 <= 0) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) [2021-11-06 11:04:32,411 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) [2021-11-06 11:04:32,948 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 11:04:32,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 11:04:32,949 INFO L168 Benchmark]: Toolchain (without parser) took 366511.29 ms. Allocated memory was 98.6 MB in the beginning and 547.4 MB in the end (delta: 448.8 MB). Free memory was 63.6 MB in the beginning and 385.3 MB in the end (delta: -321.7 MB). Peak memory consumption was 375.3 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,949 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 98.6 MB. Free memory is still 55.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 11:04:32,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2507.30 ms. Allocated memory was 98.6 MB in the beginning and 239.1 MB in the end (delta: 140.5 MB). Free memory was 63.4 MB in the beginning and 125.1 MB in the end (delta: -61.8 MB). Peak memory consumption was 81.7 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.05 ms. Allocated memory is still 239.1 MB. Free memory was 124.1 MB in the beginning and 175.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,950 INFO L168 Benchmark]: Boogie Preprocessor took 90.82 ms. Allocated memory is still 239.1 MB. Free memory was 175.0 MB in the beginning and 165.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,950 INFO L168 Benchmark]: RCFGBuilder took 7158.20 ms. Allocated memory was 239.1 MB in the beginning and 421.5 MB in the end (delta: 182.5 MB). Free memory was 165.6 MB in the beginning and 354.2 MB in the end (delta: -188.6 MB). Peak memory consumption was 250.9 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,951 INFO L168 Benchmark]: TraceAbstraction took 355975.52 ms. Allocated memory was 421.5 MB in the beginning and 547.4 MB in the end (delta: 125.8 MB). Free memory was 354.2 MB in the beginning and 385.4 MB in the end (delta: -31.3 MB). Peak memory consumption was 327.4 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,951 INFO L168 Benchmark]: Witness Printer took 621.82 ms. Allocated memory is still 547.4 MB. Free memory was 385.4 MB in the beginning and 385.3 MB in the end (delta: 149.0 kB). Peak memory consumption was 247.7 MB. Max. memory is 16.1 GB. [2021-11-06 11:04:32,952 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 98.6 MB. Free memory is still 55.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 2507.30 ms. Allocated memory was 98.6 MB in the beginning and 239.1 MB in the end (delta: 140.5 MB). Free memory was 63.4 MB in the beginning and 125.1 MB in the end (delta: -61.8 MB). Peak memory consumption was 81.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 152.05 ms. Allocated memory is still 239.1 MB. Free memory was 124.1 MB in the beginning and 175.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 90.82 ms. Allocated memory is still 239.1 MB. Free memory was 175.0 MB in the beginning and 165.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 7158.20 ms. Allocated memory was 239.1 MB in the beginning and 421.5 MB in the end (delta: 182.5 MB). Free memory was 165.6 MB in the beginning and 354.2 MB in the end (delta: -188.6 MB). Peak memory consumption was 250.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 355975.52 ms. Allocated memory was 421.5 MB in the beginning and 547.4 MB in the end (delta: 125.8 MB). Free memory was 354.2 MB in the beginning and 385.4 MB in the end (delta: -31.3 MB). Peak memory consumption was 327.4 MB. Max. memory is 16.1 GB. * Witness Printer took 621.82 ms. Allocated memory is still 547.4 MB. Free memory was 385.4 MB in the beginning and 385.3 MB in the end (delta: 149.0 kB). Peak memory consumption was 247.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] * 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 355.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 115.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2587 SDtfs, 3304 SDslu, 8638 SDs, 0 SdLazy, 2627 SolverSat, 183 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 96.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=15, InterpolantAutomatonStates: 136, 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, 17 MinimizatonAttempts, 272 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 40 PreInvPairs, 56 NumberOfFragments, 1399 HoareAnnotationTreeSize, 40 FomulaSimplifications, 592 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 40 FomulaSimplificationsInter, 237 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 189.0s SatisfiabilityAnalysisTime, 40.9s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1215 ConstructedInterpolants, 50 QuantifiedInterpolants, 7846 SizeOfPredicates, 120 NumberOfNonLiveVariables, 10861 ConjunctsInSsa, 509 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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 6 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant [2021-11-06 11:04:32,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((0 == map && required_bytes == 0) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && required_bytes == required_bytes) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \result + 1 <= 0) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-11-06 11:04:32,961 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,961 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) - InvariantResult [Line: 7414]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((0 == map && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && max_table_entries == 8) && \valid[map] == 1) && map == map - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant [2021-11-06 11:04:32,964 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,964 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) - InvariantResult [Line: 1988]: Loop Invariant [2021-11-06 11:04:32,965 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,965 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant [2021-11-06 11:04:32,966 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,966 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) - InvariantResult [Line: 10128]: Loop Invariant [2021-11-06 11:04:32,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11,QUANTIFIED] [2021-11-06 11:04:32,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((0 == map && required_bytes == 0) && !(map == 0)) && (\exists v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 : int, v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: (((\valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0 && \valid[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11] == 0) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && unknown-#memory_int-unknown[v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11][0] == 24 * num_entries) && !(v_ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base_11 == v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6))) && \valid[required_bytes] == 1) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && max_table_entries == 8) && \valid[map] == 1) && map == map) && !(map == required_bytes)) && \result == 0) || (((((((0 == map && !(map == 0)) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && map == map) && \valid[map] == 1) && map == map) && !(map == required_bytes)) - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-11-06 11:04:32,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,970 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || ((((((((((((((((((((((((0 == map && \result + 1 <= 0) && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) - InvariantResult [Line: 248]: Loop Invariant [2021-11-06 11:04:32,970 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,971 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes) - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((0 == map && cond == 1) && !(map == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && max_table_entries == 8) && \valid[map] == 1) && map == map - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant [2021-11-06 11:04:32,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] [2021-11-06 11:04:32,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((0 == map && required_bytes == 0) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && unknown-#memory_int-unknown[elemsize][0] == 24 * num_entries) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && r == required_bytes) && map == map) && unknown-#memory_int-unknown[elemsize][0] == a) && 29629528 + b == 0) && required_bytes == required_bytes) && unknown-#memory_int-unknown[elemsize][0] == unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && r == required_bytes) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) || (((((((((((((((((((((((0 == map && required_bytes == 0) && !(required_bytes == elemsize)) && !(map == elemsize)) && !(map == 0)) && \valid[elemsize] == 1) && \result + 1 <= 0) && \valid[required_bytes] == 1) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= map) && num_entries % 18446744073709551616 <= 8) && map == map) && required_bytes == required_bytes) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && max_table_entries == 8) && \valid[map] == 1) && map == map) && (\exists v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6 : int :: \valid[v_ULTIMATE.start___CPROVER_overflow_mult_~#c~1.base_6] == 0)) && elemsize == 0) && !(map == required_bytes)) - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7397]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-06 11:04:33,176 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-06 11:04:33,213 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE