./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9c1b5966 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_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 0f893dc40cf70b8d30dda6e110329e0bc2218e18bc668acf080889b069fe51ab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9c1b596 [2021-10-30 22:56:27,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-30 22:56:27,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-30 22:56:27,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-30 22:56:27,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-30 22:56:27,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-30 22:56:27,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-30 22:56:27,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-30 22:56:27,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-30 22:56:27,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-30 22:56:27,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-30 22:56:27,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-30 22:56:27,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-30 22:56:27,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-30 22:56:27,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-30 22:56:27,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-30 22:56:27,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-30 22:56:27,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-30 22:56:27,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-30 22:56:27,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-30 22:56:27,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-30 22:56:27,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-30 22:56:27,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-30 22:56:27,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-30 22:56:27,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-30 22:56:27,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-30 22:56:27,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-30 22:56:27,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-30 22:56:27,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-30 22:56:27,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-30 22:56:27,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-30 22:56:27,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-30 22:56:27,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-30 22:56:27,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-30 22:56:27,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-30 22:56:27,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-30 22:56:27,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-30 22:56:27,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-30 22:56:27,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-30 22:56:27,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-30 22:56:27,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-30 22:56:27,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-30 22:56:27,553 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-30 22:56:27,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-30 22:56:27,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-30 22:56:27,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-30 22:56:27,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-30 22:56:27,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-30 22:56:27,555 INFO L138 SettingsManager]: * Use SBE=true [2021-10-30 22:56:27,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-30 22:56:27,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-30 22:56:27,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-30 22:56:27,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-30 22:56:27,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-30 22:56:27,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-30 22:56:27,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-30 22:56:27,556 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-30 22:56:27,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-30 22:56:27,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-30 22:56:27,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-30 22:56:27,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-30 22:56:27,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-30 22:56:27,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-30 22:56:27,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-30 22:56:27,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-30 22:56:27,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-30 22:56:27,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-30 22:56:27,558 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-30 22:56:27,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-30 22:56:27,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-30 22:56:27,558 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-30 22:56:27,559 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 -> 0f893dc40cf70b8d30dda6e110329e0bc2218e18bc668acf080889b069fe51ab [2021-10-30 22:56:27,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-30 22:56:27,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-30 22:56:27,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-30 22:56:27,735 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-30 22:56:27,735 INFO L275 PluginConnector]: CDTParser initialized [2021-10-30 22:56:27,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness.i [2021-10-30 22:56:27,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a354d282/81abc20397f2483f80382f7d7af2f3cc/FLAG63be34d0f [2021-10-30 22:56:28,441 INFO L306 CDTParser]: Found 1 translation units. [2021-10-30 22:56:28,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness.i [2021-10-30 22:56:28,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a354d282/81abc20397f2483f80382f7d7af2f3cc/FLAG63be34d0f [2021-10-30 22:56:28,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a354d282/81abc20397f2483f80382f7d7af2f3cc [2021-10-30 22:56:28,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-30 22:56:28,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-30 22:56:28,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-30 22:56:28,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-30 22:56:28,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-30 22:56:28,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.10 10:56:28" (1/1) ... [2021-10-30 22:56:28,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a568984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:28, skipping insertion in model container [2021-10-30 22:56:28,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.10 10:56:28" (1/1) ... [2021-10-30 22:56:28,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-30 22:56:28,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-30 22:56:28,999 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_iter_begin_harness.i[4493,4506] [2021-10-30 22:56:29,007 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_iter_begin_harness.i[4553,4566] [2021-10-30 22:56:29,024 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-30 22:56:29,029 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-30 22:56:29,551 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,551 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,552 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,552 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,553 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,560 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,560 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,570 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,571 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,571 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,571 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:29,837 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-30 22:56:29,838 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-30 22:56:29,839 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-30 22:56:29,839 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-30 22:56:29,843 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-30 22:56:29,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-30 22:56:29,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-30 22:56:29,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-30 22:56:29,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-30 22:56:29,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-30 22:56:29,991 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-30 22:56:30,166 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,167 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,177 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,178 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,181 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,181 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,194 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,195 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,196 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,196 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,196 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,196 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-30 22:56:30,263 INFO L203 MainTranslator]: Completed pre-run [2021-10-30 22:56:30,279 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_iter_begin_harness.i[4493,4506] [2021-10-30 22:56:30,280 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_iter_begin_harness.i[4553,4566] [2021-10-30 22:56:30,281 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-30 22:56:30,281 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-30 22:56:30,303 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,303 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,303 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,304 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,304 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,308 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,308 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,308 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,309 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,309 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,324 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-30 22:56:30,326 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-30 22:56:30,326 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-30 22:56:30,327 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-30 22:56:30,327 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-30 22:56:30,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-30 22:56:30,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-30 22:56:30,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-30 22:56:30,328 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-30 22:56:30,329 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-30 22:56:30,345 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-30 22:56:30,419 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,419 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,423 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,424 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,425 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,425 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,430 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,430 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,430 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-10-30 22:56:30,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-30 22:56:30,619 INFO L208 MainTranslator]: Completed translation [2021-10-30 22:56:30,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30 WrapperNode [2021-10-30 22:56:30,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-30 22:56:30,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-30 22:56:30,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-30 22:56:30,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-30 22:56:30,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-30 22:56:30,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-30 22:56:30,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-30 22:56:30,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-30 22:56:30,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-30 22:56:30,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-30 22:56:30,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-30 22:56:30,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-30 22:56:30,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (1/1) ... [2021-10-30 22:56:30,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-30 22:56:30,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:31,001 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-10-30 22:56:31,066 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-10-30 22:56:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-10-30 22:56:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-30 22:56:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-30 22:56:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-30 22:56:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-30 22:56:31,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-30 22:56:31,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-30 22:56:38,156 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##150: assume !true; [2021-10-30 22:56:38,161 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-30 22:56:38,162 INFO L299 CfgBuilder]: Removed 157 assume(true) statements. [2021-10-30 22:56:38,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 10:56:38 BoogieIcfgContainer [2021-10-30 22:56:38,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-30 22:56:38,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-30 22:56:38,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-30 22:56:38,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-30 22:56:38,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.10 10:56:28" (1/3) ... [2021-10-30 22:56:38,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b573a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.10 10:56:38, skipping insertion in model container [2021-10-30 22:56:38,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.10 10:56:30" (2/3) ... [2021-10-30 22:56:38,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b573a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.10 10:56:38, skipping insertion in model container [2021-10-30 22:56:38,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 10:56:38" (3/3) ... [2021-10-30 22:56:38,169 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_begin_harness.i [2021-10-30 22:56:38,173 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-30 22:56:38,173 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-10-30 22:56:38,203 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-30 22:56:38,207 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-10-30 22:56:38,207 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-30 22:56:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 195 states have (on average 1.4564102564102563) internal successors, (284), 201 states have internal predecessors, (284), 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-10-30 22:56:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-30 22:56:38,225 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:38,225 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] [2021-10-30 22:56:38,226 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1999182466, now seen corresponding path program 1 times [2021-10-30 22:56:38,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:38,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130450759] [2021-10-30 22:56:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:38,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:56:38,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:38,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130450759] [2021-10-30 22:56:38,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130450759] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:38,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:38,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-30 22:56:38,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54393517] [2021-10-30 22:56:38,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-30 22:56:38,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-30 22:56:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-30 22:56:38,661 INFO L87 Difference]: Start difference. First operand has 202 states, 195 states have (on average 1.4564102564102563) internal successors, (284), 201 states have internal predecessors, (284), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-10-30 22:56:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:38,688 INFO L93 Difference]: Finished difference Result 399 states and 562 transitions. [2021-10-30 22:56:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-30 22:56:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 62 [2021-10-30 22:56:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:38,696 INFO L225 Difference]: With dead ends: 399 [2021-10-30 22:56:38,697 INFO L226 Difference]: Without dead ends: 195 [2021-10-30 22:56:38,700 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-10-30 22:56:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-30 22:56:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-30 22:56:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 189 states have (on average 1.3597883597883598) internal successors, (257), 194 states have internal predecessors, (257), 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-10-30 22:56:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 257 transitions. [2021-10-30 22:56:38,733 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 257 transitions. Word has length 62 [2021-10-30 22:56:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:38,733 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 257 transitions. [2021-10-30 22:56:38,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-10-30 22:56:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 257 transitions. [2021-10-30 22:56:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-30 22:56:38,735 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:38,736 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] [2021-10-30 22:56:38,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-30 22:56:38,739 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash 312696489, now seen corresponding path program 1 times [2021-10-30 22:56:38,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:38,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258088853] [2021-10-30 22:56:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:38,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:38,843 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:56:38,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673599726] [2021-10-30 22:56:38,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:38,844 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:38,848 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-10-30 22:56:38,917 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-10-30 22:56:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:39,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 2610 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-30 22:56:39,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:56:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:56:39,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:39,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258088853] [2021-10-30 22:56:39,890 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:56:39,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673599726] [2021-10-30 22:56:39,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673599726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:39,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:39,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-30 22:56:39,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979806517] [2021-10-30 22:56:39,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-30 22:56:39,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-30 22:56:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-30 22:56:39,892 INFO L87 Difference]: Start difference. First operand 195 states and 257 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-10-30 22:56:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:39,919 INFO L93 Difference]: Finished difference Result 317 states and 426 transitions. [2021-10-30 22:56:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-30 22:56:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2021-10-30 22:56:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:39,923 INFO L225 Difference]: With dead ends: 317 [2021-10-30 22:56:39,924 INFO L226 Difference]: Without dead ends: 196 [2021-10-30 22:56:39,924 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-10-30 22:56:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-10-30 22:56:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-10-30 22:56:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 190 states have (on average 1.3578947368421053) internal successors, (258), 195 states have internal predecessors, (258), 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-10-30 22:56:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 258 transitions. [2021-10-30 22:56:39,934 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 258 transitions. Word has length 65 [2021-10-30 22:56:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:39,934 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 258 transitions. [2021-10-30 22:56:39,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-10-30 22:56:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 258 transitions. [2021-10-30 22:56:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-30 22:56:39,936 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:39,936 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-10-30 22:56:39,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-30 22:56:40,136 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-10-30 22:56:40,137 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:40,138 INFO L85 PathProgramCache]: Analyzing trace with hash 794092388, now seen corresponding path program 1 times [2021-10-30 22:56:40,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:40,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333614556] [2021-10-30 22:56:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:40,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:40,253 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:56:40,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249663970] [2021-10-30 22:56:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:40,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:40,254 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-10-30 22:56:40,256 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-10-30 22:56:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:40,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-30 22:56:40,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:56:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:56:41,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:41,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333614556] [2021-10-30 22:56:41,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:56:41,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249663970] [2021-10-30 22:56:41,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249663970] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:56:41,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:56:41,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-10-30 22:56:41,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833512154] [2021-10-30 22:56:41,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 22:56:41,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 22:56:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-30 22:56:41,229 INFO L87 Difference]: Start difference. First operand 196 states and 258 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-10-30 22:56:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:41,258 INFO L93 Difference]: Finished difference Result 318 states and 427 transitions. [2021-10-30 22:56:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 22:56:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-10-30 22:56:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:41,259 INFO L225 Difference]: With dead ends: 318 [2021-10-30 22:56:41,260 INFO L226 Difference]: Without dead ends: 197 [2021-10-30 22:56:41,260 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 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-10-30 22:56:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-10-30 22:56:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-10-30 22:56:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 191 states have (on average 1.356020942408377) internal successors, (259), 196 states have internal predecessors, (259), 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-10-30 22:56:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 259 transitions. [2021-10-30 22:56:41,267 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 259 transitions. Word has length 66 [2021-10-30 22:56:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:41,268 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 259 transitions. [2021-10-30 22:56:41,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-10-30 22:56:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 259 transitions. [2021-10-30 22:56:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-30 22:56:41,269 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:41,269 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 22:56:41,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-30 22:56:41,475 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,SelfDestructingSolverStorable2 [2021-10-30 22:56:41,476 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1462503927, now seen corresponding path program 2 times [2021-10-30 22:56:41,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:41,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258049658] [2021-10-30 22:56:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:41,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:41,536 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:56:41,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694555735] [2021-10-30 22:56:41,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:56:41,537 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:41,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:41,538 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-10-30 22:56:41,560 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-10-30 22:56:42,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:56:42,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:56:42,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 2610 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-30 22:56:42,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:56:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-30 22:56:42,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:42,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258049658] [2021-10-30 22:56:42,741 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:56:42,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694555735] [2021-10-30 22:56:42,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694555735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:42,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:42,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 22:56:42,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491616556] [2021-10-30 22:56:42,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-30 22:56:42,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-30 22:56:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-30 22:56:42,742 INFO L87 Difference]: Start difference. First operand 197 states and 259 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 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-10-30 22:56:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:43,154 INFO L93 Difference]: Finished difference Result 280 states and 371 transitions. [2021-10-30 22:56:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-30 22:56:43,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 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 67 [2021-10-30 22:56:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:43,156 INFO L225 Difference]: With dead ends: 280 [2021-10-30 22:56:43,156 INFO L226 Difference]: Without dead ends: 198 [2021-10-30 22:56:43,157 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-30 22:56:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-30 22:56:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-10-30 22:56:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 191 states have (on average 1.3455497382198953) internal successors, (257), 196 states have internal predecessors, (257), 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-10-30 22:56:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 257 transitions. [2021-10-30 22:56:43,164 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 257 transitions. Word has length 67 [2021-10-30 22:56:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:43,164 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 257 transitions. [2021-10-30 22:56:43,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 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-10-30 22:56:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2021-10-30 22:56:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-30 22:56:43,165 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:43,166 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 22:56:43,206 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-10-30 22:56:43,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:43,367 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1906777649, now seen corresponding path program 1 times [2021-10-30 22:56:43,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:43,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651875357] [2021-10-30 22:56:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:43,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:43,426 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:56:43,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716271762] [2021-10-30 22:56:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:43,426 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:43,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:43,427 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-10-30 22:56:43,429 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-10-30 22:56:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:44,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 2629 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-30 22:56:44,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:56:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:56:44,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:44,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651875357] [2021-10-30 22:56:44,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:56:44,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716271762] [2021-10-30 22:56:44,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716271762] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:56:44,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:56:44,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-10-30 22:56:44,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844191166] [2021-10-30 22:56:44,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 22:56:44,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 22:56:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-30 22:56:44,437 INFO L87 Difference]: Start difference. First operand 197 states and 257 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-10-30 22:56:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:44,480 INFO L93 Difference]: Finished difference Result 319 states and 424 transitions. [2021-10-30 22:56:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-30 22:56:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2021-10-30 22:56:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:44,481 INFO L225 Difference]: With dead ends: 319 [2021-10-30 22:56:44,481 INFO L226 Difference]: Without dead ends: 198 [2021-10-30 22:56:44,482 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-30 22:56:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-30 22:56:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-30 22:56:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.34375) internal successors, (258), 197 states have internal predecessors, (258), 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-10-30 22:56:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 258 transitions. [2021-10-30 22:56:44,487 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 258 transitions. Word has length 68 [2021-10-30 22:56:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:44,487 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 258 transitions. [2021-10-30 22:56:44,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-10-30 22:56:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 258 transitions. [2021-10-30 22:56:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-30 22:56:44,488 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:44,488 INFO L513 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 22:56:44,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-30 22:56:44,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:44,689 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2018763882, now seen corresponding path program 2 times [2021-10-30 22:56:44,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:44,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279752538] [2021-10-30 22:56:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:44,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:44,756 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:56:44,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049783683] [2021-10-30 22:56:44,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:56:44,757 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:44,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:56:44,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-30 22:56:45,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:56:45,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:56:45,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 2615 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-30 22:56:45,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:56:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-30 22:56:45,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:45,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279752538] [2021-10-30 22:56:45,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:56:45,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049783683] [2021-10-30 22:56:45,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049783683] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:45,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:45,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 22:56:45,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376192143] [2021-10-30 22:56:45,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 22:56:45,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 22:56:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-30 22:56:45,795 INFO L87 Difference]: Start difference. First operand 198 states and 258 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-10-30 22:56:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:45,963 INFO L93 Difference]: Finished difference Result 556 states and 730 transitions. [2021-10-30 22:56:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-30 22:56:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 69 [2021-10-30 22:56:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:45,975 INFO L225 Difference]: With dead ends: 556 [2021-10-30 22:56:45,975 INFO L226 Difference]: Without dead ends: 380 [2021-10-30 22:56:45,977 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-30 22:56:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-30 22:56:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 204. [2021-10-30 22:56:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 203 states have internal predecessors, (264), 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-10-30 22:56:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 264 transitions. [2021-10-30 22:56:45,994 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 264 transitions. Word has length 69 [2021-10-30 22:56:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:45,995 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 264 transitions. [2021-10-30 22:56:45,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-10-30 22:56:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 264 transitions. [2021-10-30 22:56:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-30 22:56:45,996 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:45,996 INFO L513 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 22:56:46,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-30 22:56:46,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:46,211 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:56:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1082326934, now seen corresponding path program 1 times [2021-10-30 22:56:46,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:46,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668812088] [2021-10-30 22:56:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:46,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-30 22:56:46,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:46,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668812088] [2021-10-30 22:56:46,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668812088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:46,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:46,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-30 22:56:46,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902154271] [2021-10-30 22:56:46,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-30 22:56:46,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-30 22:56:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-30 22:56:46,677 INFO L87 Difference]: Start difference. First operand 204 states and 264 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-10-30 22:56:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:51,905 INFO L93 Difference]: Finished difference Result 408 states and 531 transitions. [2021-10-30 22:56:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-30 22:56:51,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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 73 [2021-10-30 22:56:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:51,907 INFO L225 Difference]: With dead ends: 408 [2021-10-30 22:56:51,907 INFO L226 Difference]: Without dead ends: 242 [2021-10-30 22:56:51,908 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-10-30 22:56:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-30 22:56:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2021-10-30 22:56:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 221 states have internal predecessors, (286), 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-10-30 22:56:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 286 transitions. [2021-10-30 22:56:51,919 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 286 transitions. Word has length 73 [2021-10-30 22:56:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:51,919 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 286 transitions. [2021-10-30 22:56:51,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-10-30 22:56:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 286 transitions. [2021-10-30 22:56:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-30 22:56:51,921 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:51,921 INFO L513 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 22:56:51,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-30 22:56:51,924 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-10-30 22:56:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -244659302, now seen corresponding path program 1 times [2021-10-30 22:56:51,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:51,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562645663] [2021-10-30 22:56:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:51,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-30 22:56:52,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:52,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562645663] [2021-10-30 22:56:52,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562645663] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:52,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:52,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-30 22:56:52,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909037031] [2021-10-30 22:56:52,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 22:56:52,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:52,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 22:56:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-30 22:56:52,175 INFO L87 Difference]: Start difference. First operand 222 states and 286 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-10-30 22:56:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:52,307 INFO L93 Difference]: Finished difference Result 407 states and 529 transitions. [2021-10-30 22:56:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 22:56:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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 73 [2021-10-30 22:56:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:52,308 INFO L225 Difference]: With dead ends: 407 [2021-10-30 22:56:52,309 INFO L226 Difference]: Without dead ends: 220 [2021-10-30 22:56:52,309 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-10-30 22:56:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-30 22:56:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-10-30 22:56:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 214 states have (on average 1.3037383177570094) internal successors, (279), 219 states have internal predecessors, (279), 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-10-30 22:56:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2021-10-30 22:56:52,315 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 73 [2021-10-30 22:56:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:52,315 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2021-10-30 22:56:52,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-10-30 22:56:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2021-10-30 22:56:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-30 22:56:52,315 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:52,316 INFO L513 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:56:52,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-30 22:56:52,316 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-10-30 22:56:52,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash -916560020, now seen corresponding path program 1 times [2021-10-30 22:56:52,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:52,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932673191] [2021-10-30 22:56:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:52,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-30 22:56:52,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:52,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932673191] [2021-10-30 22:56:52,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932673191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:56:52,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:56:52,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-30 22:56:52,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935572924] [2021-10-30 22:56:52,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 22:56:52,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 22:56:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-30 22:56:52,552 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-10-30 22:56:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:57,625 INFO L93 Difference]: Finished difference Result 409 states and 522 transitions. [2021-10-30 22:56:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-30 22:56:57,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 77 [2021-10-30 22:56:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:57,627 INFO L225 Difference]: With dead ends: 409 [2021-10-30 22:56:57,627 INFO L226 Difference]: Without dead ends: 226 [2021-10-30 22:56:57,627 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-10-30 22:56:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-30 22:56:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2021-10-30 22:56:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 214 states have (on average 1.2710280373831775) internal successors, (272), 219 states have internal predecessors, (272), 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-10-30 22:56:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 272 transitions. [2021-10-30 22:56:57,634 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 272 transitions. Word has length 77 [2021-10-30 22:56:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:57,635 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 272 transitions. [2021-10-30 22:56:57,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-10-30 22:56:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2021-10-30 22:56:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-30 22:56:57,639 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:57,639 INFO L513 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:56:57,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-30 22:56:57,639 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-10-30 22:56:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash -299985813, now seen corresponding path program 1 times [2021-10-30 22:56:57,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:57,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526596394] [2021-10-30 22:56:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:57,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:56:58,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:56:58,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526596394] [2021-10-30 22:56:58,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526596394] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:56:58,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176168416] [2021-10-30 22:56:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:58,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:58,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:56:58,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:56:58,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-30 22:56:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:56:58,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-30 22:56:58,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:56:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:56:59,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176168416] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:56:59,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-30 22:56:59,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-10-30 22:56:59,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575336373] [2021-10-30 22:56:59,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-30 22:56:59,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:56:59,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-30 22:56:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-10-30 22:56:59,291 INFO L87 Difference]: Start difference. First operand 220 states and 272 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-10-30 22:56:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:56:59,330 INFO L93 Difference]: Finished difference Result 342 states and 433 transitions. [2021-10-30 22:56:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-30 22:56:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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 79 [2021-10-30 22:56:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:56:59,344 INFO L225 Difference]: With dead ends: 342 [2021-10-30 22:56:59,345 INFO L226 Difference]: Without dead ends: 221 [2021-10-30 22:56:59,345 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-10-30 22:56:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-10-30 22:56:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-10-30 22:56:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 220 states have internal predecessors, (273), 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-10-30 22:56:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2021-10-30 22:56:59,353 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 79 [2021-10-30 22:56:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:56:59,353 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2021-10-30 22:56:59,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-10-30 22:56:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2021-10-30 22:56:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-30 22:56:59,354 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:56:59,355 INFO L513 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:56:59,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-30 22:56:59,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:56:59,579 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-10-30 22:56:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:56:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1708954468, now seen corresponding path program 2 times [2021-10-30 22:56:59,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:56:59,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096865449] [2021-10-30 22:56:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:56:59,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:56:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:00,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:00,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096865449] [2021-10-30 22:57:00,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096865449] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:00,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910269902] [2021-10-30 22:57:00,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:57:00,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:00,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:00,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-30 22:57:00,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:57:00,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:57:00,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 2698 conjuncts, 45 conjunts are in the unsatisfiable core [2021-10-30 22:57:00,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:01,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2021-10-30 22:57:01,586 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-30 22:57:01,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2021-10-30 22:57:01,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2021-10-30 22:57:01,923 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-30 22:57:01,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2021-10-30 22:57:02,061 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-30 22:57:02,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 14 [2021-10-30 22:57:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-30 22:57:02,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910269902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:57:02,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:57:02,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2021-10-30 22:57:02,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009778087] [2021-10-30 22:57:02,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-30 22:57:02,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-30 22:57:02,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-10-30 22:57:02,143 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-10-30 22:57:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:12,834 INFO L93 Difference]: Finished difference Result 436 states and 557 transitions. [2021-10-30 22:57:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-30 22:57:12,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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 80 [2021-10-30 22:57:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:12,836 INFO L225 Difference]: With dead ends: 436 [2021-10-30 22:57:12,836 INFO L226 Difference]: Without dead ends: 337 [2021-10-30 22:57:12,837 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2021-10-30 22:57:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-10-30 22:57:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 237. [2021-10-30 22:57:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 231 states have (on average 1.2640692640692641) internal successors, (292), 236 states have internal predecessors, (292), 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-10-30 22:57:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 292 transitions. [2021-10-30 22:57:12,845 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 292 transitions. Word has length 80 [2021-10-30 22:57:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:12,845 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 292 transitions. [2021-10-30 22:57:12,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-10-30 22:57:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 292 transitions. [2021-10-30 22:57:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-30 22:57:12,846 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:12,846 INFO L513 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:12,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-10-30 22:57:13,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:13,047 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-10-30 22:57:13,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1574895578, now seen corresponding path program 1 times [2021-10-30 22:57:13,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:13,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919841708] [2021-10-30 22:57:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:13,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:13,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:13,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919841708] [2021-10-30 22:57:13,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919841708] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:13,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543421271] [2021-10-30 22:57:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:13,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:13,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:13,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:13,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-30 22:57:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:14,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-30 22:57:14,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:14,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543421271] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:14,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-30 22:57:14,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-10-30 22:57:14,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151447505] [2021-10-30 22:57:14,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-30 22:57:14,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-30 22:57:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-30 22:57:14,778 INFO L87 Difference]: Start difference. First operand 237 states and 292 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 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-10-30 22:57:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:14,871 INFO L93 Difference]: Finished difference Result 375 states and 472 transitions. [2021-10-30 22:57:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-30 22:57:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 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 80 [2021-10-30 22:57:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:14,872 INFO L225 Difference]: With dead ends: 375 [2021-10-30 22:57:14,872 INFO L226 Difference]: Without dead ends: 238 [2021-10-30 22:57:14,873 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-30 22:57:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-30 22:57:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-10-30 22:57:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 237 states have internal predecessors, (293), 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-10-30 22:57:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2021-10-30 22:57:14,880 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 80 [2021-10-30 22:57:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:14,880 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2021-10-30 22:57:14,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 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-10-30 22:57:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2021-10-30 22:57:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-30 22:57:14,881 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:14,881 INFO L513 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:14,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:15,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-30 22:57:15,093 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:57:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 846540233, now seen corresponding path program 2 times [2021-10-30 22:57:15,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:15,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460802939] [2021-10-30 22:57:15,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:15,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:15,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:15,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460802939] [2021-10-30 22:57:15,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460802939] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:15,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389657851] [2021-10-30 22:57:15,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:57:15,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:15,568 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:15,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-30 22:57:16,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:57:16,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:57:16,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 2693 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-30 22:57:16,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:17,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2021-10-30 22:57:17,181 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 36 treesize of output 28 [2021-10-30 22:57:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-30 22:57:17,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389657851] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:57:17,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:57:17,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2021-10-30 22:57:17,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563963076] [2021-10-30 22:57:17,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-30 22:57:17,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-30 22:57:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-10-30 22:57:17,310 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-10-30 22:57:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:20,459 INFO L93 Difference]: Finished difference Result 337 states and 424 transitions. [2021-10-30 22:57:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-30 22:57:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 81 [2021-10-30 22:57:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:20,461 INFO L225 Difference]: With dead ends: 337 [2021-10-30 22:57:20,461 INFO L226 Difference]: Without dead ends: 222 [2021-10-30 22:57:20,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-10-30 22:57:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-30 22:57:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-10-30 22:57:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 221 states have internal predecessors, (271), 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-10-30 22:57:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2021-10-30 22:57:20,469 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 81 [2021-10-30 22:57:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:20,469 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2021-10-30 22:57:20,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-10-30 22:57:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2021-10-30 22:57:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-30 22:57:20,470 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:20,470 INFO L513 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:20,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-10-30 22:57:20,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-30 22:57:20,688 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-10-30 22:57:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1401751239, now seen corresponding path program 1 times [2021-10-30 22:57:20,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:20,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565325935] [2021-10-30 22:57:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:20,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:21,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:21,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565325935] [2021-10-30 22:57:21,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565325935] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:21,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667901873] [2021-10-30 22:57:21,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:21,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:21,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:21,207 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:21,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-30 22:57:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:22,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 2742 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-30 22:57:22,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:22,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667901873] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:22,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-30 22:57:22,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-10-30 22:57:22,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677151858] [2021-10-30 22:57:22,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-30 22:57:22,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-30 22:57:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-10-30 22:57:22,672 INFO L87 Difference]: Start difference. First operand 222 states and 271 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-10-30 22:57:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:22,725 INFO L93 Difference]: Finished difference Result 344 states and 429 transitions. [2021-10-30 22:57:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-30 22:57:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-10-30 22:57:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:22,726 INFO L225 Difference]: With dead ends: 344 [2021-10-30 22:57:22,726 INFO L226 Difference]: Without dead ends: 223 [2021-10-30 22:57:22,727 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-10-30 22:57:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-10-30 22:57:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-10-30 22:57:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.2534562211981566) internal successors, (272), 222 states have internal predecessors, (272), 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-10-30 22:57:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2021-10-30 22:57:22,734 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 84 [2021-10-30 22:57:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:22,734 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2021-10-30 22:57:22,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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-10-30 22:57:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2021-10-30 22:57:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-10-30 22:57:22,735 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:22,735 INFO L513 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:22,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:22,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-30 22:57:22,958 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-10-30 22:57:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1953277238, now seen corresponding path program 2 times [2021-10-30 22:57:22,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:22,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633372385] [2021-10-30 22:57:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:22,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:23,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:23,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633372385] [2021-10-30 22:57:23,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633372385] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:23,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704948156] [2021-10-30 22:57:23,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:57:23,444 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:23,447 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:23,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-30 22:57:24,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:57:24,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:57:24,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 2707 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-30 22:57:24,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-30 22:57:24,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704948156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:57:24,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:57:24,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2021-10-30 22:57:24,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331173113] [2021-10-30 22:57:24,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-30 22:57:24,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-30 22:57:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-30 22:57:24,621 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-10-30 22:57:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:25,012 INFO L93 Difference]: Finished difference Result 435 states and 546 transitions. [2021-10-30 22:57:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-30 22:57:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 85 [2021-10-30 22:57:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:25,014 INFO L225 Difference]: With dead ends: 435 [2021-10-30 22:57:25,014 INFO L226 Difference]: Without dead ends: 299 [2021-10-30 22:57:25,014 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-10-30 22:57:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-30 22:57:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 207. [2021-10-30 22:57:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 206 states have internal predecessors, (251), 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-10-30 22:57:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-10-30 22:57:25,021 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 85 [2021-10-30 22:57:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:25,022 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-10-30 22:57:25,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-10-30 22:57:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-10-30 22:57:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-30 22:57:25,022 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:25,022 INFO L513 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:25,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:25,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-30 22:57:25,245 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-10-30 22:57:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash -14478783, now seen corresponding path program 1 times [2021-10-30 22:57:25,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:25,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553086087] [2021-10-30 22:57:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:25,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:25,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:25,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553086087] [2021-10-30 22:57:25,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553086087] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:25,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853172542] [2021-10-30 22:57:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:25,763 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:25,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:25,767 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:25,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-30 22:57:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:26,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 2822 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-30 22:57:26,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:27,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853172542] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:27,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-30 22:57:27,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-10-30 22:57:27,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620915655] [2021-10-30 22:57:27,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-30 22:57:27,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:27,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-30 22:57:27,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2021-10-30 22:57:27,343 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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-10-30 22:57:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:27,401 INFO L93 Difference]: Finished difference Result 329 states and 408 transitions. [2021-10-30 22:57:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-30 22:57:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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 88 [2021-10-30 22:57:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:27,418 INFO L225 Difference]: With dead ends: 329 [2021-10-30 22:57:27,418 INFO L226 Difference]: Without dead ends: 208 [2021-10-30 22:57:27,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2021-10-30 22:57:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-30 22:57:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-10-30 22:57:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 202 states have (on average 1.2475247524752475) internal successors, (252), 207 states have internal predecessors, (252), 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-10-30 22:57:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 252 transitions. [2021-10-30 22:57:27,425 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 252 transitions. Word has length 88 [2021-10-30 22:57:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:27,426 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 252 transitions. [2021-10-30 22:57:27,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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-10-30 22:57:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 252 transitions. [2021-10-30 22:57:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-30 22:57:27,427 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:27,427 INFO L513 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:27,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:27,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-30 22:57:27,650 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-10-30 22:57:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash 426570604, now seen corresponding path program 2 times [2021-10-30 22:57:27,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:27,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737277476] [2021-10-30 22:57:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:27,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:28,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:28,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737277476] [2021-10-30 22:57:28,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737277476] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:28,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143420965] [2021-10-30 22:57:28,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:57:28,255 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:28,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:28,256 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:28,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-30 22:57:29,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:57:29,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:57:29,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 2780 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-30 22:57:29,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-30 22:57:29,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143420965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:57:29,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:57:29,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-10-30 22:57:29,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374137190] [2021-10-30 22:57:29,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-30 22:57:29,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:29,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-30 22:57:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-10-30 22:57:29,629 INFO L87 Difference]: Start difference. First operand 208 states and 252 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10-30 22:57:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:29,779 INFO L93 Difference]: Finished difference Result 393 states and 477 transitions. [2021-10-30 22:57:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-30 22:57:29,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10-30 22:57:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:29,781 INFO L225 Difference]: With dead ends: 393 [2021-10-30 22:57:29,781 INFO L226 Difference]: Without dead ends: 208 [2021-10-30 22:57:29,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-30 22:57:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-30 22:57:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2021-10-30 22:57:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2346938775510203) internal successors, (242), 201 states have internal predecessors, (242), 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-10-30 22:57:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 242 transitions. [2021-10-30 22:57:29,790 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 242 transitions. Word has length 89 [2021-10-30 22:57:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:29,790 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 242 transitions. [2021-10-30 22:57:29,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-10-30 22:57:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 242 transitions. [2021-10-30 22:57:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-30 22:57:29,791 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:29,791 INFO L513 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:29,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:30,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-30 22:57:30,004 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:57:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash 502500184, now seen corresponding path program 1 times [2021-10-30 22:57:30,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:30,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900503435] [2021-10-30 22:57:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:30,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:30,080 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:57:30,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912193404] [2021-10-30 22:57:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:30,081 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:30,096 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:30,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-30 22:57:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:31,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-30 22:57:31,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:31,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:31,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900503435] [2021-10-30 22:57:31,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:57:31,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912193404] [2021-10-30 22:57:31,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912193404] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:31,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:57:31,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-10-30 22:57:31,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800192785] [2021-10-30 22:57:31,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-30 22:57:31,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:31,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-30 22:57:31,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-10-30 22:57:31,672 INFO L87 Difference]: Start difference. First operand 202 states and 242 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-10-30 22:57:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:31,725 INFO L93 Difference]: Finished difference Result 324 states and 399 transitions. [2021-10-30 22:57:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-30 22:57:31,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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 95 [2021-10-30 22:57:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:31,726 INFO L225 Difference]: With dead ends: 324 [2021-10-30 22:57:31,726 INFO L226 Difference]: Without dead ends: 203 [2021-10-30 22:57:31,727 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-10-30 22:57:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-10-30 22:57:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-10-30 22:57:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.233502538071066) internal successors, (243), 202 states have internal predecessors, (243), 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-10-30 22:57:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 243 transitions. [2021-10-30 22:57:31,733 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 243 transitions. Word has length 95 [2021-10-30 22:57:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:31,733 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 243 transitions. [2021-10-30 22:57:31,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-10-30 22:57:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2021-10-30 22:57:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-30 22:57:31,733 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:31,733 INFO L513 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:31,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-10-30 22:57:31,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:31,956 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:57:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash -726950603, now seen corresponding path program 2 times [2021-10-30 22:57:31,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:31,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762382573] [2021-10-30 22:57:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:31,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:32,000 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:57:32,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813842654] [2021-10-30 22:57:32,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:57:32,001 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:32,016 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:32,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-30 22:57:33,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:57:33,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:57:33,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 2908 conjuncts, 45 conjunts are in the unsatisfiable core [2021-10-30 22:57:33,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:33,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:33,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2021-10-30 22:57:33,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-10-30 22:57:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,608 INFO L354 Elim1Store]: treesize reduction 254, result has 17.3 percent of original size [2021-10-30 22:57:34,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 101 [2021-10-30 22:57:34,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-30 22:57:34,741 INFO L354 Elim1Store]: treesize reduction 150, result has 19.8 percent of original size [2021-10-30 22:57:34,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 92 treesize of output 108 [2021-10-30 22:57:35,023 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 16 treesize of output 8 [2021-10-30 22:57:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-30 22:57:35,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:35,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762382573] [2021-10-30 22:57:35,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:57:35,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813842654] [2021-10-30 22:57:35,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813842654] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:57:35,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:57:35,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-30 22:57:35,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450151481] [2021-10-30 22:57:35,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-30 22:57:35,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:35,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-30 22:57:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-30 22:57:35,089 INFO L87 Difference]: Start difference. First operand 203 states and 243 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-10-30 22:57:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:45,308 INFO L93 Difference]: Finished difference Result 277 states and 339 transitions. [2021-10-30 22:57:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-30 22:57:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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 96 [2021-10-30 22:57:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:45,309 INFO L225 Difference]: With dead ends: 277 [2021-10-30 22:57:45,309 INFO L226 Difference]: Without dead ends: 204 [2021-10-30 22:57:45,310 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-10-30 22:57:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-10-30 22:57:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2021-10-30 22:57:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 202 states have internal predecessors, (241), 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-10-30 22:57:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2021-10-30 22:57:45,317 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 241 transitions. Word has length 96 [2021-10-30 22:57:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:45,318 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 241 transitions. [2021-10-30 22:57:45,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-10-30 22:57:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2021-10-30 22:57:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-30 22:57:45,318 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:45,319 INFO L513 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:45,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:45,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:45,539 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:57:45,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1176931502, now seen corresponding path program 1 times [2021-10-30 22:57:45,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:45,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803256091] [2021-10-30 22:57:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:45,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:45,603 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:57:45,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423731726] [2021-10-30 22:57:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:45,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:45,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:45,605 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:45,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-30 22:57:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:57:46,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 2979 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-30 22:57:46,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:57:47,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:47,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803256091] [2021-10-30 22:57:47,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:57:47,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423731726] [2021-10-30 22:57:47,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423731726] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:57:47,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:57:47,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-10-30 22:57:47,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298262523] [2021-10-30 22:57:47,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-30 22:57:47,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-30 22:57:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-10-30 22:57:47,313 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 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-10-30 22:57:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:57:47,360 INFO L93 Difference]: Finished difference Result 325 states and 396 transitions. [2021-10-30 22:57:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-30 22:57:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 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 99 [2021-10-30 22:57:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:57:47,361 INFO L225 Difference]: With dead ends: 325 [2021-10-30 22:57:47,361 INFO L226 Difference]: Without dead ends: 204 [2021-10-30 22:57:47,362 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-10-30 22:57:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-10-30 22:57:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-10-30 22:57:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 203 states have internal predecessors, (242), 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-10-30 22:57:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 242 transitions. [2021-10-30 22:57:47,368 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 242 transitions. Word has length 99 [2021-10-30 22:57:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:57:47,368 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 242 transitions. [2021-10-30 22:57:47,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 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-10-30 22:57:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 242 transitions. [2021-10-30 22:57:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-30 22:57:47,368 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:57:47,368 INFO L513 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:57:47,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-30 22:57:47,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:47,569 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:57:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:57:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1347112623, now seen corresponding path program 2 times [2021-10-30 22:57:47,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:57:47,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308229628] [2021-10-30 22:57:47,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:57:47,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:57:47,611 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:57:47,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670631034] [2021-10-30 22:57:47,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:57:47,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:57:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:57:47,628 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:57:47,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-30 22:57:48,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 22:57:48,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 22:57:48,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 2923 conjuncts, 81 conjunts are in the unsatisfiable core [2021-10-30 22:57:48,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:57:49,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2021-10-30 22:57:50,278 INFO L354 Elim1Store]: treesize reduction 228, result has 4.6 percent of original size [2021-10-30 22:57:50,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 107 [2021-10-30 22:57:50,340 INFO L354 Elim1Store]: treesize reduction 160, result has 6.4 percent of original size [2021-10-30 22:57:50,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 93 [2021-10-30 22:57:50,350 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-30 22:57:50,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 81 [2021-10-30 22:57:50,898 INFO L354 Elim1Store]: treesize reduction 57, result has 17.4 percent of original size [2021-10-30 22:57:50,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 138 treesize of output 96 [2021-10-30 22:57:50,977 INFO L354 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2021-10-30 22:57:50,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 66 [2021-10-30 22:57:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-30 22:57:51,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:57:51,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308229628] [2021-10-30 22:57:51,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:57:51,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670631034] [2021-10-30 22:57:51,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670631034] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 22:57:51,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 22:57:51,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-30 22:57:51,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023060901] [2021-10-30 22:57:51,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-30 22:57:51,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:57:51,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-30 22:57:51,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-10-30 22:57:51,186 INFO L87 Difference]: Start difference. First operand 204 states and 242 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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-10-30 22:58:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:58:01,978 INFO L93 Difference]: Finished difference Result 366 states and 455 transitions. [2021-10-30 22:58:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-30 22:58:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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 100 [2021-10-30 22:58:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:58:01,980 INFO L225 Difference]: With dead ends: 366 [2021-10-30 22:58:01,980 INFO L226 Difference]: Without dead ends: 272 [2021-10-30 22:58:01,981 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2021-10-30 22:58:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-30 22:58:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 204. [2021-10-30 22:58:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 198 states have (on average 1.2171717171717171) internal successors, (241), 203 states have internal predecessors, (241), 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-10-30 22:58:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2021-10-30 22:58:01,991 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 100 [2021-10-30 22:58:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:58:01,992 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2021-10-30 22:58:01,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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-10-30 22:58:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2021-10-30 22:58:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-30 22:58:01,993 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:58:01,993 INFO L513 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:58:02,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-10-30 22:58:02,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:58:02,207 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:58:02,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:58:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1607201967, now seen corresponding path program 1 times [2021-10-30 22:58:02,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:58:02,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755706069] [2021-10-30 22:58:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:58:02,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:58:02,249 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:58:02,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160166438] [2021-10-30 22:58:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:58:02,249 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:58:02,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:58:02,250 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:58:02,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-30 22:58:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 22:58:03,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 3032 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-30 22:58:03,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 22:58:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-30 22:58:04,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 22:58:04,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755706069] [2021-10-30 22:58:04,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 22:58:04,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160166438] [2021-10-30 22:58:04,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160166438] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-30 22:58:04,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-10-30 22:58:04,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-10-30 22:58:04,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910052392] [2021-10-30 22:58:04,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-30 22:58:04,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 22:58:04,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-30 22:58:04,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-10-30 22:58:04,028 INFO L87 Difference]: Start difference. First operand 204 states and 241 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 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-10-30 22:58:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 22:58:04,075 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2021-10-30 22:58:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-30 22:58:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 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 103 [2021-10-30 22:58:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 22:58:04,076 INFO L225 Difference]: With dead ends: 326 [2021-10-30 22:58:04,076 INFO L226 Difference]: Without dead ends: 205 [2021-10-30 22:58:04,077 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-10-30 22:58:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-10-30 22:58:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-10-30 22:58:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 199 states have (on average 1.2160804020100502) internal successors, (242), 204 states have internal predecessors, (242), 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-10-30 22:58:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2021-10-30 22:58:04,084 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 103 [2021-10-30 22:58:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 22:58:04,084 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2021-10-30 22:58:04,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 12 states have internal predecessors, (103), 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-10-30 22:58:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2021-10-30 22:58:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-30 22:58:04,085 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 22:58:04,085 INFO L513 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 22:58:04,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-30 22:58:04,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:58:04,299 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 22:58:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 22:58:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1761008012, now seen corresponding path program 2 times [2021-10-30 22:58:04,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 22:58:04,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916350193] [2021-10-30 22:58:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 22:58:04,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 22:58:04,339 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 22:58:04,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591047735] [2021-10-30 22:58:04,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-30 22:58:04,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 22:58:04,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 22:58:04,356 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 22:58:04,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-10-30 23:04:16,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-30 23:04:16,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-30 23:04:16,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 2969 conjuncts, 182 conjunts are in the unsatisfiable core [2021-10-30 23:04:16,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 23:04:17,612 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 13 treesize of output 9 [2021-10-30 23:04:18,284 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-10-30 23:04:18,285 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 27 treesize of output 26 [2021-10-30 23:04:19,764 INFO L354 Elim1Store]: treesize reduction 71, result has 29.7 percent of original size [2021-10-30 23:04:19,764 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 2 case distinctions, treesize of input 86 treesize of output 72 [2021-10-30 23:04:19,773 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 82 treesize of output 78 [2021-10-30 23:04:19,782 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 91 treesize of output 87 [2021-10-30 23:04:20,409 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 84 treesize of output 28 [2021-10-30 23:04:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-30 23:04:21,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:04:21,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916350193] [2021-10-30 23:04:21,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 23:04:21,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591047735] [2021-10-30 23:04:21,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591047735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:04:21,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:04:21,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-30 23:04:21,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32668108] [2021-10-30 23:04:21,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-30 23:04:21,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:04:21,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-30 23:04:21,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2021-10-30 23:04:21,387 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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-10-30 23:05:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:01,173 INFO L93 Difference]: Finished difference Result 407 states and 480 transitions. [2021-10-30 23:05:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-30 23:05:01,174 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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 104 [2021-10-30 23:05:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:01,175 INFO L225 Difference]: With dead ends: 407 [2021-10-30 23:05:01,175 INFO L226 Difference]: Without dead ends: 221 [2021-10-30 23:05:01,176 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2021-10-30 23:05:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-10-30 23:05:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2021-10-30 23:05:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 204 states have (on average 1.2107843137254901) internal successors, (247), 209 states have internal predecessors, (247), 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-10-30 23:05:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-10-30 23:05:01,186 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 104 [2021-10-30 23:05:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:01,186 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-10-30 23:05:01,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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-10-30 23:05:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-10-30 23:05:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-30 23:05:01,187 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:01,187 INFO L513 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 23:05:01,387 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forcibly destroying the process [2021-10-30 23:05:01,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 137 [2021-10-30 23:05:01,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 23:05:01,441 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 23:05:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash 152233000, now seen corresponding path program 1 times [2021-10-30 23:05:01,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:01,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100744885] [2021-10-30 23:05:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:01,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:01,510 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 23:05:01,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926603587] [2021-10-30 23:05:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:01,511 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 23:05:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 23:05:01,512 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 23:05:01,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-10-30 23:05:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:02,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 3048 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-30 23:05:02,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 23:05:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-30 23:05:03,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:03,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100744885] [2021-10-30 23:05:03,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 23:05:03,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926603587] [2021-10-30 23:05:03,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926603587] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:03,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:03,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-30 23:05:03,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630026190] [2021-10-30 23:05:03,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-30 23:05:03,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-30 23:05:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-30 23:05:03,257 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-10-30 23:05:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:03,487 INFO L93 Difference]: Finished difference Result 401 states and 473 transitions. [2021-10-30 23:05:03,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-30 23:05:03,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 106 [2021-10-30 23:05:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:03,489 INFO L225 Difference]: With dead ends: 401 [2021-10-30 23:05:03,489 INFO L226 Difference]: Without dead ends: 201 [2021-10-30 23:05:03,489 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 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-10-30 23:05:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-30 23:05:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-10-30 23:05:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 195 states have (on average 1.205128205128205) internal successors, (235), 200 states have internal predecessors, (235), 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-10-30 23:05:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 235 transitions. [2021-10-30 23:05:03,499 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 235 transitions. Word has length 106 [2021-10-30 23:05:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:03,499 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 235 transitions. [2021-10-30 23:05:03,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-10-30 23:05:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 235 transitions. [2021-10-30 23:05:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-30 23:05:03,500 INFO L505 BasicCegarLoop]: Found error trace [2021-10-30 23:05:03,500 INFO L513 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-30 23:05:03,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-10-30 23:05:03,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-10-30 23:05:03,719 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-10-30 23:05:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-30 23:05:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1129119696, now seen corresponding path program 1 times [2021-10-30 23:05:03,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-30 23:05:03,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375496403] [2021-10-30 23:05:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:03,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-30 23:05:03,769 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-30 23:05:03,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135369694] [2021-10-30 23:05:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-30 23:05:03,770 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-30 23:05:03,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-30 23:05:03,771 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-30 23:05:03,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-10-30 23:05:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-30 23:05:05,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 3048 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-30 23:05:05,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-30 23:05:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-30 23:05:05,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-30 23:05:05,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375496403] [2021-10-30 23:05:05,494 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-30 23:05:05,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135369694] [2021-10-30 23:05:05,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135369694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-30 23:05:05,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-30 23:05:05,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-30 23:05:05,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204779471] [2021-10-30 23:05:05,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-30 23:05:05,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-30 23:05:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-30 23:05:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-30 23:05:05,495 INFO L87 Difference]: Start difference. First operand 201 states and 235 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-10-30 23:05:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-30 23:05:05,614 INFO L93 Difference]: Finished difference Result 201 states and 235 transitions. [2021-10-30 23:05:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-30 23:05:05,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 106 [2021-10-30 23:05:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-30 23:05:05,614 INFO L225 Difference]: With dead ends: 201 [2021-10-30 23:05:05,614 INFO L226 Difference]: Without dead ends: 0 [2021-10-30 23:05:05,615 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 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-10-30 23:05:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-30 23:05:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-30 23:05:05,615 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-10-30 23:05:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-30 23:05:05,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2021-10-30 23:05:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-30 23:05:05,615 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-30 23:05:05,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-10-30 23:05:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-30 23:05:05,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-30 23:05:05,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:05:05,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:05:05,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:05:05,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:05:05,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:05:05,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-30 23:05:05,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-10-30 23:05:05,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-10-30 23:05:05,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-30 23:05:05,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:05,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-30 23:05:11,941 INFO L853 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|))) (let ((.cse0 (select (select |#memory_int| .cse2) (+ 40 .cse1)))) (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (mod (+ 18446744073679922088 (* .cse0 24)) 18446744073709551616) 36028797018963967) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse1) (= .cse2 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (<= .cse0 32) (< (+ .cse2 1) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (< 0 |#StackHeapBarrier|)))) [2021-10-30 23:05:11,941 INFO L853 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:05:11,941 INFO L853 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:05:11,941 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,941 INFO L853 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:05:11,941 INFO L853 garLoopResultBuilder]: At program point L10044-4(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:05:11,941 INFO L853 garLoopResultBuilder]: At program point L10044-5(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:05:11,942 INFO L853 garLoopResultBuilder]: At program point L10044-6(lines 9999 10046) the Hoare annotation is: false [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10079-2(line 10079) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L853 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse2 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse3 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse0 .cse1 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) .cse2 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (= (+ (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) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse3 (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (< 1 |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) .cse2 .cse3))) [2021-10-30 23:05:11,942 INFO L853 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (< 1 |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10079(line 10079) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10079-1(line 10079) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10114(lines 10114 10129) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L853 garLoopResultBuilder]: At program point L9817(lines 9817 9830) the Hoare annotation is: false [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10082(lines 10082 10083) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10082-6(lines 10082 10083) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10082-8(lines 10082 10083) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10082-2(lines 10082 10083) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10082-4(lines 10082 10083) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L853 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-10-30 23:05:11,942 INFO L853 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse4 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse6 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse7 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32)) (.cse8 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse9 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32)) (.cse10 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse11 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse12 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse13 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse14 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (+ (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) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10082-10(lines 10082 10083) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,942 INFO L857 garLoopResultBuilder]: For program point L10085(line 10085) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L10085-1(line 10085) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L10085-2(line 10085) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L853 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse0)) (let ((.cse1 (mod .cse0 18446744073709551616))) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= .cse1 36028797018963967)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 36028797018963967 .cse1))))))) (= (+ (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) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_hash_table_state_required_bytes_#res| 0)) [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L9821-1(line 9821) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L853 garLoopResultBuilder]: At program point L9821-2(line 9821) the Hoare annotation is: false [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L9821-3(line 9821) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L10087-2(line 10087) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L10054-1(lines 10054 10058) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L10054-2(lines 10054 10058) no Hoare annotation was computed. [2021-10-30 23:05:11,943 INFO L857 garLoopResultBuilder]: For program point L10087-4(line 10087) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L10087(line 10087) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L10054(lines 10054 10058) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L10087-10(line 10087) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L10087-6(line 10087) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L10087-8(line 10087) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L853 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse4 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse6 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse7 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32)) (.cse8 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse9 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32)) (.cse10 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse11 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse12 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse13 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse14 (< 0 |#StackHeapBarrier|))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse5 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (= (* 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|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-30 23:05:11,944 INFO L853 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,944 INFO L857 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9825-5(line 9825) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L853 garLoopResultBuilder]: At program point L9825-7(lines 9788 9829) the Hoare annotation is: false [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9825(line 9825) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L853 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|))) (let ((.cse0 (select (select |#memory_int| .cse2) (+ 40 .cse1)))) (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (mod (+ 18446744073679922088 (* .cse0 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse1) (= .cse2 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (<= .cse0 32) (< (+ .cse2 1) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (< 0 |#StackHeapBarrier|)))) [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9825-1(line 9825) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9825-3(line 9825) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L853 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_s_get_next_element_~iter.base) 0) 0) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (< 1 ULTIMATE.start_aws_hash_iter_begin_~map.base) (< 1 |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_aws_hash_iter_begin_~map.offset 0) (< 1 ULTIMATE.start_s_get_next_element_~iter.base) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_iter_begin_~#iter~1.offset| 0) (< 1 (select (select |#memory_$Pointer$.base| ULTIMATE.start_s_get_next_element_~iter.base) 0)) (= ULTIMATE.start_s_get_next_element_~iter.offset 0) (< 1 |ULTIMATE.start_aws_hash_iter_begin_~#iter~1.base|) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,945 INFO L853 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (< 1 ULTIMATE.start_aws_hash_iter_begin_~map.base) (< 1 |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_aws_hash_iter_begin_~map.offset 0) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9825-8(lines 9825 9829) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,945 INFO L857 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L10090(lines 10052 10093) the Hoare annotation is: false [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-28(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-33(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L9990-34(lines 9988 9991) the Hoare annotation is: false [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-35(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L10090-1(lines 10052 10093) the Hoare annotation is: false [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-30(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L10090-2(lines 10052 10093) the Hoare annotation is: false [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-31(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L9990-41(lines 9988 9991) the Hoare annotation is: false [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-42(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-44(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-37(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-38(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-40(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-45(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L857 garLoopResultBuilder]: For program point L9990-47(line 9990) no Hoare annotation was computed. [2021-10-30 23:05:11,946 INFO L853 garLoopResultBuilder]: At program point L9990-48(lines 9988 9991) the Hoare annotation is: false [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= 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| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (= 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 32) (= 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_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= 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| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (= 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 32) (= 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_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L10059(lines 10059 10063) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L10059-1(lines 10059 10063) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L10059-2(lines 10059 10063) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L10126-2(line 10126) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L10126(line 10126) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L9796-2(lines 9796 9805) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L9796-3(lines 9796 9805) the Hoare annotation is: false [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L9796-4(lines 9796 9805) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= (* 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|)) (= 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| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (exists ((|ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and (= .cse0 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (= .cse0 ULTIMATE.start_aws_add_u64_checked_~a)))) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (= (+ 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 32) (= 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_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-30 23:05:11,947 INFO L853 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|))) (let ((.cse0 (select (select |#memory_int| .cse2) (+ 40 .cse1)))) (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (mod (+ 18446744073679922088 (* .cse0 24)) 18446744073709551616) 36028797018963967) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse1) (= .cse2 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (<= .cse0 32) (< (+ .cse2 1) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (< 0 |#StackHeapBarrier|)))) [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2630-7(lines 2626 2631) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L9799(lines 9799 9804) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L860 garLoopResultBuilder]: At program point L10130(line 10130) the Hoare annotation is: true [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L10064(lines 10064 10068) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L10064-1(lines 10064 10068) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L10064-2(lines 10064 10068) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse4 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse6 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse7 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32)) (.cse8 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse9 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32)) (.cse10 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse11 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse12 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse13 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse14 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 (= (* 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|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= 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| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (= 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 32) (= 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_hash_table_state_required_bytes_~#elemsize~0.offset| 0) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,948 INFO L853 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:05:11,948 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001-4(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001-5(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001-6(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,949 INFO L857 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10069(lines 10069 10073) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10069-1(lines 10069 10073) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10069-2(lines 10069 10073) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L853 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L853 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: false [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10075(lines 10075 10088) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10075-1(lines 10075 10088) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10075-2(lines 10075 10088) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10076(line 10076) no Hoare annotation was computed. [2021-10-30 23:05:11,950 INFO L857 garLoopResultBuilder]: For program point L10076-1(line 10076) no Hoare annotation was computed. [2021-10-30 23:05:11,951 INFO L857 garLoopResultBuilder]: For program point L10076-2(line 10076) no Hoare annotation was computed. [2021-10-30 23:05:11,951 INFO L853 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-10-30 23:05:11,951 INFO L853 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= ULTIMATE.start_aws_mul_u64_checked_~b 24)) (.cse4 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse6 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|)) (.cse7 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32)) (.cse8 (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|)) (.cse9 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 32)) (.cse10 (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a)) (.cse11 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base)) (.cse12 (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|)) (.cse13 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (.cse14 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (+ (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) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-30 23:05:11,951 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_iter_begin_harness_~#map~0.base|) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 32) (< 0 |#StackHeapBarrier|)) [2021-10-30 23:05:11,953 INFO L731 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-30 23:05:11,954 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-30 23:05:11,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,968 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,979 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:11,979 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:11,980 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:11,980 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:11,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,985 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:11,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:11,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:11,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:11,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:11,986 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:11,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:11,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:11,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.10 11:05:11 BoogieIcfgContainer [2021-10-30 23:05:11,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-30 23:05:11,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-30 23:05:11,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-30 23:05:11,992 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-30 23:05:11,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.10 10:56:38" (3/4) ... [2021-10-30 23:05:11,995 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-30 23:05:12,013 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 203 nodes and edges [2021-10-30 23:05:12,015 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2021-10-30 23:05:12,016 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-10-30 23:05:12,018 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-30 23:05:12,019 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-30 23:05:12,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-30 23:05:12,022 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-30 23:05:12,023 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-30 23:05:12,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((required_bytes == 0 && map == 0) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-10-30 23:05:12,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && \result + 1 <= 0) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((required_bytes == 0 && map == 0) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-10-30 23:05:12,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((required_bytes == 0 && map == 0) && map == map) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && 0 < unknown-#StackHeapBarrier-unknown) && \result == 0) || (((((map == 0 && map == map) && \result + 1 <= 0) && 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) [2021-10-30 23:05:12,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((required_bytes == 0 && map == 0) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && r == required_bytes) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && max_table_entries <= 32) && 29629528 + b == 0) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && r == required_bytes) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((required_bytes == 0 && map == 0) && cond == 1) && !(\result == 0)) && map == map) && unknown-#StackHeapBarrier-unknown < map) && map == map) && \result + 1 < map) && max_table_entries <= 32) && num_entries <= 32) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && ((cond == 1 && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967) || (cond == 0 && 36028797018963967 < unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616)))) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && 0 < unknown-#StackHeapBarrier-unknown) && \result == 0 [2021-10-30 23:05:12,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((required_bytes == 0 && map == 0) && map == map) && \result + 1 <= 0) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-10-30 23:05:12,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((required_bytes == 0 && map == 0) && map == map) && \result + 1 <= 0) && b == 24) && elemsize == r) && \result + 1 <= 0) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-10-30 23:05:12,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((map == map && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && map == 0) && !(\result == 0)) && map == map) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] * 24) % 18446744073709551616 <= 36028797018963967) && unknown-#StackHeapBarrier-unknown < map) && map == #memory_$Pointer$[map][map]) && #memory_$Pointer$[map][map] == map) && \result == 0) && map == map) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] <= 32) && #memory_$Pointer$[map][map] + 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((map == map && map == 0) && !(\result == 0)) && map == map) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] * 24) % 18446744073709551616 <= 36028797018963967) && \result == 0) && unknown-#StackHeapBarrier-unknown < map) && map == #memory_$Pointer$[map][map]) && #memory_$Pointer$[map][map] == map) && \result == 0) && map == map) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] <= 32) && #memory_$Pointer$[map][map] + 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((map == map && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && map == 0) && !(\result == 0)) && map == map) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] * 24) % 18446744073709551616 <= 36028797018963967) && unknown-#StackHeapBarrier-unknown < map) && map == #memory_$Pointer$[map][map]) && #memory_$Pointer$[map][map] == map) && map == map) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] <= 32) && #memory_$Pointer$[map][map] + 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,052 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\result + 1 <= 0 && map == 0) && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(#memory_$Pointer$[map][map] == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,052 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result + 1 <= 0 && map == 0) && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && \result + 1 <= 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(#memory_$Pointer$[map][map] == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,052 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(#memory_$Pointer$[map][map] == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,052 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,053 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result == 0) && 1 < map) && 1 < map) && map == 0) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,055 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[iter][0] == 0) && \result == 0) && 1 < map) && 1 < map) && map == 0) && 1 < iter) && map == map) && iter == 0) && 1 < #memory_$Pointer$[iter][0]) && iter == 0) && 1 < iter) && 0 < unknown-#StackHeapBarrier-unknown [2021-10-30 23:05:12,523 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-30 23:05:12,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-30 23:05:12,524 INFO L168 Benchmark]: Toolchain (without parser) took 523920.47 ms. Allocated memory was 83.9 MB in the beginning and 580.9 MB in the end (delta: 497.0 MB). Free memory was 54.1 MB in the beginning and 340.9 MB in the end (delta: -286.7 MB). Peak memory consumption was 429.5 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,525 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 83.9 MB. Free memory is still 62.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-30 23:05:12,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2015.09 ms. Allocated memory was 83.9 MB in the beginning and 180.4 MB in the end (delta: 96.5 MB). Free memory was 53.9 MB in the beginning and 86.5 MB in the end (delta: -32.6 MB). Peak memory consumption was 82.3 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.99 ms. Allocated memory is still 180.4 MB. Free memory was 86.5 MB in the beginning and 118.9 MB in the end (delta: -32.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,525 INFO L168 Benchmark]: Boogie Preprocessor took 113.97 ms. Allocated memory is still 180.4 MB. Free memory was 118.9 MB in the beginning and 107.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,525 INFO L168 Benchmark]: RCFGBuilder took 7220.33 ms. Allocated memory was 180.4 MB in the beginning and 362.8 MB in the end (delta: 182.5 MB). Free memory was 107.4 MB in the beginning and 212.7 MB in the end (delta: -105.3 MB). Peak memory consumption was 212.4 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,526 INFO L168 Benchmark]: TraceAbstraction took 513827.03 ms. Allocated memory was 362.8 MB in the beginning and 580.9 MB in the end (delta: 218.1 MB). Free memory was 212.7 MB in the beginning and 347.8 MB in the end (delta: -135.1 MB). Peak memory consumption was 285.4 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,526 INFO L168 Benchmark]: Witness Printer took 531.74 ms. Allocated memory is still 580.9 MB. Free memory was 347.8 MB in the beginning and 340.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 225.0 MB. Max. memory is 16.1 GB. [2021-10-30 23:05:12,527 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.15 ms. Allocated memory is still 83.9 MB. Free memory is still 62.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 2015.09 ms. Allocated memory was 83.9 MB in the beginning and 180.4 MB in the end (delta: 96.5 MB). Free memory was 53.9 MB in the beginning and 86.5 MB in the end (delta: -32.6 MB). Peak memory consumption was 82.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 206.99 ms. Allocated memory is still 180.4 MB. Free memory was 86.5 MB in the beginning and 118.9 MB in the end (delta: -32.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 113.97 ms. Allocated memory is still 180.4 MB. Free memory was 118.9 MB in the beginning and 107.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 7220.33 ms. Allocated memory was 180.4 MB in the beginning and 362.8 MB in the end (delta: 182.5 MB). Free memory was 107.4 MB in the beginning and 212.7 MB in the end (delta: -105.3 MB). Peak memory consumption was 212.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 513827.03 ms. Allocated memory was 362.8 MB in the beginning and 580.9 MB in the end (delta: 218.1 MB). Free memory was 212.7 MB in the beginning and 347.8 MB in the end (delta: -135.1 MB). Peak memory consumption was 285.4 MB. Max. memory is 16.1 GB. * Witness Printer took 531.74 ms. Allocated memory is still 580.9 MB. Free memory was 347.8 MB in the beginning and 340.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 225.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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, 202 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 513.7s, OverallIterations: 25, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 87.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5774 SDtfs, 6494 SDslu, 16939 SDs, 0 SdLazy, 3325 SolverSat, 368 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 65.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1969 GetRequests, 1683 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=12, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 481 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 78 NumberOfFragments, 1594 HoareAnnotationTreeSize, 52 FomulaSimplifications, 989 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 52 FomulaSimplificationsInter, 305 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 2.3s SsaConstructionTime, 381.8s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 2761 NumberOfCodeBlocks, 2707 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2728 ConstructedInterpolants, 6 QuantifiedInterpolants, 6791 SizeOfPredicates, 232 NumberOfNonLiveVariables, 58827 ConjunctsInSsa, 501 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 347/638 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: 9788]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((((((((((required_bytes == 0 && map == 0) && map == map) && \result + 1 <= 0) && b == 24) && elemsize == r) && \result + 1 <= 0) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((((((((((required_bytes == 0 && map == 0) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 10052]: 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: 266]: Loop Invariant Derived loop invariant: ((((map == 0 && map == map) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 1988]: Loop Invariant [2021-10-30 23:05:12,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,544 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(#memory_$Pointer$[map][map] == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant [2021-10-30 23:05:12,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,549 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((map == map && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && map == 0) && !(\result == 0)) && map == map) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] * 24) % 18446744073709551616 <= 36028797018963967) && unknown-#StackHeapBarrier-unknown < map) && map == #memory_$Pointer$[map][map]) && #memory_$Pointer$[map][map] == map) && map == map) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] <= 32) && #memory_$Pointer$[map][map] + 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9999]: Loop Invariant [2021-10-30 23:05:12,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((map == map && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && map == 0) && !(\result == 0)) && map == map) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] * 24) % 18446744073709551616 <= 36028797018963967) && unknown-#StackHeapBarrier-unknown < map) && map == #memory_$Pointer$[map][map]) && #memory_$Pointer$[map][map] == map) && \result == 0) && map == map) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] <= 32) && #memory_$Pointer$[map][map] + 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant [2021-10-30 23:05:12,555 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:12,556 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:12,556 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-10-30 23:05:12,556 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((((required_bytes == 0 && map == 0) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && r == required_bytes) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && max_table_entries <= 32) && 29629528 + b == 0) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && r == required_bytes) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((((((map == 0 && map == map) && unknown-#StackHeapBarrier-unknown < map) && map == map) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9796]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2021-10-30 23:05:12,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((\result + 1 <= 0 && map == 0) && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(#memory_$Pointer$[map][map] == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9988]: Loop Invariant [2021-10-30 23:05:12,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && #memory_$Pointer$[iter][0] == 0) && \result == 0) && 1 < map) && 1 < map) && map == 0) && 1 < iter) && map == map) && iter == 0) && 1 < #memory_$Pointer$[iter][0]) && iter == 0) && 1 < iter) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9821]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9817]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant [2021-10-30 23:05:12,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((\result + 1 <= 0 && map == 0) && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && \result + 1 <= 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(#memory_$Pointer$[map][map] == 0)) && max_table_entries <= 32) && num_entries <= 32) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 10052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: ((((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result == 0) && 1 < map) && 1 < map) && map == 0) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((((((((((((((\result + 1 <= 0 && required_bytes == 0) && map == 0) && map == map) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && \result + 1 <= 0) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((required_bytes == 0 && map == 0) && map == map) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 6943]: Loop Invariant [2021-10-30 23:05:12,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:12,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:12,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:12,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:12,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-10-30 23:05:12,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] Derived loop invariant: ((((((((((((required_bytes == 0 && map == 0) && cond == 1) && !(\result == 0)) && map == map) && unknown-#StackHeapBarrier-unknown < map) && map == map) && \result + 1 < map) && max_table_entries <= 32) && num_entries <= 32) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && ((cond == 1 && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967) || (cond == 0 && 36028797018963967 < unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616)))) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && 0 < unknown-#StackHeapBarrier-unknown) && \result == 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-10-30 23:05:12,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,567 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-30 23:05:12,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-30 23:05:12,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((map == map && map == 0) && !(\result == 0)) && map == map) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] * 24) % 18446744073709551616 <= 36028797018963967) && \result == 0) && unknown-#StackHeapBarrier-unknown < map) && map == #memory_$Pointer$[map][map]) && #memory_$Pointer$[map][map] == map) && \result == 0) && map == map) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && (cond == 1 || cond == 0)) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40 + #memory_$Pointer$[map][map]] <= 32) && #memory_$Pointer$[map][map] + 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((map == 0 && !(\result == 0)) && map == map) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((((required_bytes == 0 && map == 0) && map == map) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && num_entries <= 32) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && 0 < unknown-#StackHeapBarrier-unknown) && \result == 0) || (((((map == 0 && map == map) && \result + 1 <= 0) && 1 < map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((((((required_bytes == 0 && map == 0) && map == map) && \result + 1 <= 0) && b == 24) && elemsize == r) && \result + 1 <= 0) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) || (((((((((((((((required_bytes == 0 && map == 0) && map == map) && b == 24) && elemsize == r) && unknown-#StackHeapBarrier-unknown < map) && map == map) && max_table_entries <= 32) && required_bytes == required_bytes) && num_entries <= 32) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && num_entries == a) && required_bytes == required_bytes) && r == elemsize) && elemsize == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-10-30 23:05:12,791 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-10-30 23:05:12,821 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...