./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_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 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:41:45,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:41:45,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:41:45,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:41:45,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:41:45,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:41:45,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:41:45,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:41:45,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:41:45,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:41:45,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:41:45,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:41:45,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:41:45,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:41:45,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:41:45,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:41:45,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:41:45,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:41:45,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:41:45,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:41:45,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:41:45,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:41:45,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:41:45,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:41:45,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:41:45,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:41:45,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:41:45,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:41:45,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:41:45,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:41:45,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:41:45,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:41:45,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:41:45,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:41:45,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:41:45,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:41:45,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:41:45,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:41:45,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:41:45,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:41:45,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:41:45,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 00:41:45,574 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:41:45,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:41:45,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:41:45,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:41:45,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:41:45,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:41:45,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:41:45,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:41:45,577 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:41:45,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:41:45,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:41:45,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:41:45,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:41:45,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:41:45,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:41:45,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:41:45,579 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:41:45,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:41:45,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:41:45,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:41:45,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:41:45,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:41:45,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:41:45,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:41:45,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:41:45,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:41:45,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:41:45,582 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:41:45,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:41:45,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:41:45,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:41:45,582 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 -> 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 [2021-12-18 00:41:45,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:41:45,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:41:45,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:41:45,845 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:41:45,846 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:41:45,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-12-18 00:41:45,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c35d0b87/e3c73dbe64f74541901a2695c68a5c7e/FLAG7671c8ee4 [2021-12-18 00:41:46,544 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:41:46,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-12-18 00:41:46,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c35d0b87/e3c73dbe64f74541901a2695c68a5c7e/FLAG7671c8ee4 [2021-12-18 00:41:46,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c35d0b87/e3c73dbe64f74541901a2695c68a5c7e [2021-12-18 00:41:46,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:41:46,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:41:46,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:41:46,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:41:46,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:41:46,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:41:46" (1/1) ... [2021-12-18 00:41:46,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4cca38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:46, skipping insertion in model container [2021-12-18 00:41:46,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:41:46" (1/1) ... [2021-12-18 00:41:46,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:41:46,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:41:47,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2021-12-18 00:41:47,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2021-12-18 00:41:47,715 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,717 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,718 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,719 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,720 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,734 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,734 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,738 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,740 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,742 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,743 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,744 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:47,744 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,023 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:41:48,025 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:41:48,026 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:41:48,027 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:41:48,028 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:41:48,028 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:41:48,029 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:41:48,029 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:41:48,030 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:41:48,031 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:41:48,207 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:41:48,410 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,410 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,435 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,436 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,442 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,443 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,460 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,461 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,463 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,464 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,464 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,464 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,465 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:41:48,565 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:41:48,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4495,4508] [2021-12-18 00:41:48,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i[4555,4568] [2021-12-18 00:41:48,623 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,624 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,624 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,624 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,625 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,632 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,633 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,633 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,634 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,634 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,635 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,635 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,635 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,661 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:41:48,664 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:41:48,664 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:41:48,665 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:41:48,666 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:41:48,666 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:41:48,666 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:41:48,667 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:41:48,667 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:41:48,667 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:41:48,686 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:41:48,792 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,792 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,797 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,798 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,800 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,800 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,809 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,810 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,810 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,811 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,811 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,812 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,812 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:41:48,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:41:49,055 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:41:49,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49 WrapperNode [2021-12-18 00:41:49,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:41:49,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:41:49,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:41:49,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:41:49,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,210 INFO L137 Inliner]: procedures = 775, calls = 2499, calls flagged for inlining = 69, calls inlined = 19, statements flattened = 1070 [2021-12-18 00:41:49,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:41:49,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:41:49,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:41:49,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:41:49,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:41:49,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:41:49,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:41:49,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:41:49,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (1/1) ... [2021-12-18 00:41:49,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:41:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:49,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 00:41:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 00:41:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-18 00:41:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-18 00:41:49,372 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-18 00:41:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 00:41:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-12-18 00:41:49,372 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:41:49,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2021-12-18 00:41:49,373 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:41:49,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:41:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-18 00:41:49,375 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-18 00:41:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-12-18 00:41:49,375 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-12-18 00:41:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 00:41:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2021-12-18 00:41:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2021-12-18 00:41:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 00:41:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:41:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:41:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 00:41:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2021-12-18 00:41:49,377 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2021-12-18 00:41:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2021-12-18 00:41:49,377 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2021-12-18 00:41:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2021-12-18 00:41:49,377 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2021-12-18 00:41:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2021-12-18 00:41:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2021-12-18 00:41:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2021-12-18 00:41:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2021-12-18 00:41:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 00:41:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-18 00:41:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2021-12-18 00:41:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2021-12-18 00:41:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-18 00:41:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-18 00:41:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2021-12-18 00:41:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2021-12-18 00:41:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2021-12-18 00:41:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:41:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2021-12-18 00:41:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-18 00:41:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-18 00:41:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-12-18 00:41:49,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-12-18 00:41:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2021-12-18 00:41:49,381 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2021-12-18 00:41:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2021-12-18 00:41:49,381 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2021-12-18 00:41:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2021-12-18 00:41:49,381 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2021-12-18 00:41:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2021-12-18 00:41:49,381 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2021-12-18 00:41:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-12-18 00:41:49,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-12-18 00:41:49,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:41:49,756 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:41:49,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:41:49,959 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !true; [2021-12-18 00:41:49,960 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2021-12-18 00:41:49,982 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2021-12-18 00:41:50,015 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2021-12-18 00:41:50,529 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !true; [2021-12-18 00:41:50,530 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !true; [2021-12-18 00:41:50,548 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:41:50,555 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:41:50,556 INFO L301 CfgBuilder]: Removed 16 assume(true) statements. [2021-12-18 00:41:50,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:41:50 BoogieIcfgContainer [2021-12-18 00:41:50,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:41:50,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:41:50,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:41:50,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:41:50,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:41:46" (1/3) ... [2021-12-18 00:41:50,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1d1941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:41:50, skipping insertion in model container [2021-12-18 00:41:50,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:49" (2/3) ... [2021-12-18 00:41:50,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1d1941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:41:50, skipping insertion in model container [2021-12-18 00:41:50,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:41:50" (3/3) ... [2021-12-18 00:41:50,568 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_remove_harness.i [2021-12-18 00:41:50,573 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:41:50,573 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:41:50,622 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:41:50,639 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 00:41:50,639 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:41:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 315 states, 205 states have (on average 1.248780487804878) internal successors, (256), 200 states have internal predecessors, (256), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2021-12-18 00:41:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-18 00:41:50,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:50,687 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:50,687 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1499271925, now seen corresponding path program 1 times [2021-12-18 00:41:50,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:50,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935190660] [2021-12-18 00:41:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:50,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:51,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:51,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935190660] [2021-12-18 00:41:51,339 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-12-18 00:41:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956282772] [2021-12-18 00:41:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:51,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:51,346 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-12-18 00:41:51,347 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-12-18 00:41:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:51,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 2903 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-18 00:41:51,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2021-12-18 00:41:52,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:41:52,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956282772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:52,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:41:52,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 00:41:52,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150689054] [2021-12-18 00:41:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:52,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 00:41:52,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:52,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 00:41:52,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:41:52,422 INFO L87 Difference]: Start difference. First operand has 315 states, 205 states have (on average 1.248780487804878) internal successors, (256), 200 states have internal predecessors, (256), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:52,487 INFO L93 Difference]: Finished difference Result 624 states and 904 transitions. [2021-12-18 00:41:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 00:41:52,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2021-12-18 00:41:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:52,499 INFO L225 Difference]: With dead ends: 624 [2021-12-18 00:41:52,499 INFO L226 Difference]: Without dead ends: 307 [2021-12-18 00:41:52,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:41:52,507 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:52,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:41:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-18 00:41:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2021-12-18 00:41:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 192 states have (on average 1.21875) internal successors, (234), 194 states have internal predecessors, (234), 87 states have call successors, (87), 27 states have call predecessors, (87), 27 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2021-12-18 00:41:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 406 transitions. [2021-12-18 00:41:52,570 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 406 transitions. Word has length 184 [2021-12-18 00:41:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:52,572 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 406 transitions. [2021-12-18 00:41:52,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2021-12-18 00:41:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-18 00:41:52,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:52,575 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:52,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 00:41:52,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-18 00:41:52,780 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1512102767, now seen corresponding path program 1 times [2021-12-18 00:41:52,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:52,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380350361] [2021-12-18 00:41:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:52,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:52,869 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:41:52,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246824449] [2021-12-18 00:41:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:52,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:52,872 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-12-18 00:41:52,873 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-12-18 00:41:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:53,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2903 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 00:41:53,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2021-12-18 00:41:53,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:41:53,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:53,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380350361] [2021-12-18 00:41:53,814 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:41:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246824449] [2021-12-18 00:41:53,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246824449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:53,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:41:53,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:41:53,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364057844] [2021-12-18 00:41:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:53,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:41:53,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:41:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:41:53,816 INFO L87 Difference]: Start difference. First operand 307 states and 406 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:53,904 INFO L93 Difference]: Finished difference Result 577 states and 767 transitions. [2021-12-18 00:41:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:41:53,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2021-12-18 00:41:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:53,912 INFO L225 Difference]: With dead ends: 577 [2021-12-18 00:41:53,912 INFO L226 Difference]: Without dead ends: 312 [2021-12-18 00:41:53,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:41:53,918 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 2 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:53,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1608 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:41:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-18 00:41:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-12-18 00:41:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.2142857142857142) internal successors, (238), 198 states have internal predecessors, (238), 87 states have call successors, (87), 27 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2021-12-18 00:41:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 411 transitions. [2021-12-18 00:41:53,956 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 411 transitions. Word has length 184 [2021-12-18 00:41:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:53,958 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 411 transitions. [2021-12-18 00:41:53,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 411 transitions. [2021-12-18 00:41:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-18 00:41:53,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:53,966 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:53,998 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-12-18 00:41:54,171 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,SelfDestructingSolverStorable1 [2021-12-18 00:41:54,172 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1624119493, now seen corresponding path program 1 times [2021-12-18 00:41:54,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:54,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460732246] [2021-12-18 00:41:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:54,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:41:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:41:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:41:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:41:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:41:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 00:41:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:41:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:41:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:41:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 00:41:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 00:41:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-18 00:41:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 00:41:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:41:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-18 00:41:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 00:41:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:41:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:41:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-18 00:41:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-18 00:41:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-18 00:41:54,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:54,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460732246] [2021-12-18 00:41:54,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460732246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:41:54,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180436544] [2021-12-18 00:41:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:54,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:54,888 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-12-18 00:41:54,916 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-12-18 00:41:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:55,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 00:41:55,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-12-18 00:41:55,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:41:55,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180436544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:55,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:41:55,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2021-12-18 00:41:55,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890516185] [2021-12-18 00:41:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:55,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:41:55,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:55,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:41:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:41:55,947 INFO L87 Difference]: Start difference. First operand 312 states and 411 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2021-12-18 00:41:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:56,215 INFO L93 Difference]: Finished difference Result 570 states and 763 transitions. [2021-12-18 00:41:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:41:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 190 [2021-12-18 00:41:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:56,220 INFO L225 Difference]: With dead ends: 570 [2021-12-18 00:41:56,220 INFO L226 Difference]: Without dead ends: 319 [2021-12-18 00:41:56,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:41:56,222 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 434 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:56,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1330 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:41:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-18 00:41:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2021-12-18 00:41:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 201 states have (on average 1.2139303482587065) internal successors, (244), 204 states have internal predecessors, (244), 88 states have call successors, (88), 27 states have call predecessors, (88), 29 states have return successors, (90), 87 states have call predecessors, (90), 86 states have call successors, (90) [2021-12-18 00:41:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 422 transitions. [2021-12-18 00:41:56,246 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 422 transitions. Word has length 190 [2021-12-18 00:41:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:56,247 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 422 transitions. [2021-12-18 00:41:56,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2021-12-18 00:41:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 422 transitions. [2021-12-18 00:41:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-18 00:41:56,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:56,251 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:56,280 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-12-18 00:41:56,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:56,464 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash -424896713, now seen corresponding path program 1 times [2021-12-18 00:41:56,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:56,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271645143] [2021-12-18 00:41:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:56,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:41:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:41:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:41:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:41:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:41:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 00:41:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:41:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:41:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:41:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 00:41:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 00:41:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-18 00:41:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 00:41:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:41:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-18 00:41:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 00:41:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:41:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:41:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-18 00:41:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-18 00:41:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-18 00:41:57,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:57,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271645143] [2021-12-18 00:41:57,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271645143] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:41:57,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474831298] [2021-12-18 00:41:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:57,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:57,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:57,097 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-12-18 00:41:57,098 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-12-18 00:41:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:57,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 2917 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 00:41:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-12-18 00:41:58,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:41:58,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474831298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:58,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:41:58,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2021-12-18 00:41:58,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442185903] [2021-12-18 00:41:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:58,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:41:58,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:41:58,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:41:58,172 INFO L87 Difference]: Start difference. First operand 319 states and 422 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2021-12-18 00:41:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:58,438 INFO L93 Difference]: Finished difference Result 539 states and 718 transitions. [2021-12-18 00:41:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:41:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 190 [2021-12-18 00:41:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:58,441 INFO L225 Difference]: With dead ends: 539 [2021-12-18 00:41:58,441 INFO L226 Difference]: Without dead ends: 312 [2021-12-18 00:41:58,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:41:58,443 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 456 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:58,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 1307 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:41:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-18 00:41:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-12-18 00:41:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 196 states have (on average 1.2091836734693877) internal successors, (237), 198 states have internal predecessors, (237), 87 states have call successors, (87), 27 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2021-12-18 00:41:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2021-12-18 00:41:58,461 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 190 [2021-12-18 00:41:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:58,463 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2021-12-18 00:41:58,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2021-12-18 00:41:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2021-12-18 00:41:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-18 00:41:58,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:58,466 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:58,497 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-12-18 00:41:58,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:58,692 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -673043207, now seen corresponding path program 1 times [2021-12-18 00:41:58,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:58,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846536924] [2021-12-18 00:41:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:58,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:41:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:41:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:41:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:41:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:41:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 00:41:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:41:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:41:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:41:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 00:41:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 00:41:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-18 00:41:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 00:41:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:41:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-18 00:41:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 00:41:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:41:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:41:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-18 00:41:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-18 00:41:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-18 00:41:59,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846536924] [2021-12-18 00:41:59,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846536924] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:41:59,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170340389] [2021-12-18 00:41:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:59,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:59,251 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-12-18 00:41:59,276 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-12-18 00:41:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:59,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 2922 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 00:41:59,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:00,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:42:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-12-18 00:42:00,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:42:00,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170340389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:42:00,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:42:00,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2021-12-18 00:42:00,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360994674] [2021-12-18 00:42:00,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:00,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:42:00,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:00,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:42:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-12-18 00:42:00,634 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2021-12-18 00:42:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:00,791 INFO L93 Difference]: Finished difference Result 570 states and 755 transitions. [2021-12-18 00:42:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:42:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 190 [2021-12-18 00:42:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:00,794 INFO L225 Difference]: With dead ends: 570 [2021-12-18 00:42:00,794 INFO L226 Difference]: Without dead ends: 316 [2021-12-18 00:42:00,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:42:00,797 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 65 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:00,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1849 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2021-12-18 00:42:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-18 00:42:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-12-18 00:42:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 200 states have (on average 1.205) internal successors, (241), 201 states have internal predecessors, (241), 87 states have call successors, (87), 28 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2021-12-18 00:42:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 414 transitions. [2021-12-18 00:42:00,814 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 414 transitions. Word has length 190 [2021-12-18 00:42:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:00,815 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 414 transitions. [2021-12-18 00:42:00,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2021-12-18 00:42:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 414 transitions. [2021-12-18 00:42:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-12-18 00:42:00,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:00,818 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:00,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-18 00:42:01,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:01,035 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1638806615, now seen corresponding path program 1 times [2021-12-18 00:42:01,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:01,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215783440] [2021-12-18 00:42:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:01,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:42:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:42:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 00:42:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 00:42:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 00:42:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 00:42:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 00:42:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-18 00:42:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 00:42:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 00:42:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:42:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-18 00:42:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-18 00:42:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-18 00:42:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2021-12-18 00:42:01,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:01,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215783440] [2021-12-18 00:42:01,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215783440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:01,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233724298] [2021-12-18 00:42:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:01,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:01,500 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-12-18 00:42:01,509 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-12-18 00:42:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:02,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 2946 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 00:42:02,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:03,104 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2021-12-18 00:42:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-12-18 00:42:09,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:42:09,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233724298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:42:09,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:42:09,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-12-18 00:42:09,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589697019] [2021-12-18 00:42:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:09,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:42:09,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:42:09,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2021-12-18 00:42:09,015 INFO L87 Difference]: Start difference. First operand 316 states and 414 transitions. Second operand has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2021-12-18 00:42:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:09,241 INFO L93 Difference]: Finished difference Result 572 states and 763 transitions. [2021-12-18 00:42:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:42:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) Word has length 196 [2021-12-18 00:42:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:09,244 INFO L225 Difference]: With dead ends: 572 [2021-12-18 00:42:09,245 INFO L226 Difference]: Without dead ends: 319 [2021-12-18 00:42:09,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2021-12-18 00:42:09,246 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 5 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:09,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 2179 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 558 Unchecked, 0.1s Time] [2021-12-18 00:42:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-18 00:42:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2021-12-18 00:42:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 202 states have (on average 1.202970297029703) internal successors, (243), 202 states have internal predecessors, (243), 87 states have call successors, (87), 29 states have call predecessors, (87), 28 states have return successors, (86), 86 states have call predecessors, (86), 85 states have call successors, (86) [2021-12-18 00:42:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 416 transitions. [2021-12-18 00:42:09,259 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 416 transitions. Word has length 196 [2021-12-18 00:42:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:09,259 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 416 transitions. [2021-12-18 00:42:09,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2021-12-18 00:42:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 416 transitions. [2021-12-18 00:42:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-18 00:42:09,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:09,262 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:09,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-18 00:42:09,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:09,476 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1031269532, now seen corresponding path program 1 times [2021-12-18 00:42:09,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:09,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937836945] [2021-12-18 00:42:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:09,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:42:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:42:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:42:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-18 00:42:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-18 00:42:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2021-12-18 00:42:09,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937836945] [2021-12-18 00:42:09,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937836945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:42:09,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:42:09,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:42:09,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848025676] [2021-12-18 00:42:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:09,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:42:09,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:42:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:42:09,992 INFO L87 Difference]: Start difference. First operand 318 states and 416 transitions. Second operand has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2021-12-18 00:42:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:11,092 INFO L93 Difference]: Finished difference Result 539 states and 714 transitions. [2021-12-18 00:42:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:42:11,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2021-12-18 00:42:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:11,095 INFO L225 Difference]: With dead ends: 539 [2021-12-18 00:42:11,095 INFO L226 Difference]: Without dead ends: 332 [2021-12-18 00:42:11,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:42:11,097 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 411 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:11,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 1238 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 00:42:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-18 00:42:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-12-18 00:42:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 203 states have (on average 1.2019704433497538) internal successors, (244), 204 states have internal predecessors, (244), 87 states have call successors, (87), 29 states have call predecessors, (87), 29 states have return successors, (92), 86 states have call predecessors, (92), 85 states have call successors, (92) [2021-12-18 00:42:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 423 transitions. [2021-12-18 00:42:11,114 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 423 transitions. Word has length 201 [2021-12-18 00:42:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:11,114 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 423 transitions. [2021-12-18 00:42:11,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2021-12-18 00:42:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2021-12-18 00:42:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-18 00:42:11,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:11,117 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:11,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 00:42:11,117 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1674168939, now seen corresponding path program 1 times [2021-12-18 00:42:11,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:11,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433187892] [2021-12-18 00:42:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:11,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:42:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:42:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:42:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-18 00:42:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-18 00:42:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2021-12-18 00:42:11,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433187892] [2021-12-18 00:42:11,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433187892] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207686319] [2021-12-18 00:42:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:11,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:11,892 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-12-18 00:42:11,893 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-12-18 00:42:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:12,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 00:42:12,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2021-12-18 00:42:12,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:42:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-12-18 00:42:13,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207686319] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:13,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:42:13,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17, 8] total 25 [2021-12-18 00:42:13,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458981786] [2021-12-18 00:42:13,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:13,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:42:13,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:13,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:42:13,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2021-12-18 00:42:13,358 INFO L87 Difference]: Start difference. First operand 320 states and 423 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2021-12-18 00:42:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:13,414 INFO L93 Difference]: Finished difference Result 328 states and 430 transitions. [2021-12-18 00:42:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:42:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2021-12-18 00:42:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:13,417 INFO L225 Difference]: With dead ends: 328 [2021-12-18 00:42:13,417 INFO L226 Difference]: Without dead ends: 326 [2021-12-18 00:42:13,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:42:13,418 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 13 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:13,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 1589 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:42:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-12-18 00:42:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2021-12-18 00:42:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 206 states have (on average 1.1990291262135921) internal successors, (247), 207 states have internal predecessors, (247), 87 states have call successors, (87), 30 states have call predecessors, (87), 30 states have return successors, (92), 86 states have call predecessors, (92), 85 states have call successors, (92) [2021-12-18 00:42:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 426 transitions. [2021-12-18 00:42:13,433 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 426 transitions. Word has length 206 [2021-12-18 00:42:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:13,433 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 426 transitions. [2021-12-18 00:42:13,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2021-12-18 00:42:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 426 transitions. [2021-12-18 00:42:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-12-18 00:42:13,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:13,436 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:13,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 00:42:13,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:13,665 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash 799406762, now seen corresponding path program 1 times [2021-12-18 00:42:13,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:13,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816032174] [2021-12-18 00:42:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:13,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:42:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:42:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:42:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-18 00:42:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-18 00:42:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-12-18 00:42:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-12-18 00:42:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2021-12-18 00:42:14,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:14,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816032174] [2021-12-18 00:42:14,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816032174] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:14,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362246576] [2021-12-18 00:42:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:14,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:14,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:14,582 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-12-18 00:42:14,584 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-12-18 00:42:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:15,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 00:42:15,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2021-12-18 00:42:15,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:42:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-12-18 00:42:16,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362246576] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:16,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:42:16,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17, 8] total 25 [2021-12-18 00:42:16,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062441759] [2021-12-18 00:42:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:16,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:42:16,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:42:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2021-12-18 00:42:16,132 INFO L87 Difference]: Start difference. First operand 324 states and 426 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2021-12-18 00:42:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:16,192 INFO L93 Difference]: Finished difference Result 332 states and 433 transitions. [2021-12-18 00:42:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:42:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2021-12-18 00:42:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:16,195 INFO L225 Difference]: With dead ends: 332 [2021-12-18 00:42:16,195 INFO L226 Difference]: Without dead ends: 330 [2021-12-18 00:42:16,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:42:16,196 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 6 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:16,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1597 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:42:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-12-18 00:42:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2021-12-18 00:42:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 209 states have (on average 1.1961722488038278) internal successors, (250), 210 states have internal predecessors, (250), 87 states have call successors, (87), 31 states have call predecessors, (87), 31 states have return successors, (92), 86 states have call predecessors, (92), 85 states have call successors, (92) [2021-12-18 00:42:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 429 transitions. [2021-12-18 00:42:16,212 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 429 transitions. Word has length 219 [2021-12-18 00:42:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:16,213 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 429 transitions. [2021-12-18 00:42:16,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2021-12-18 00:42:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 429 transitions. [2021-12-18 00:42:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-12-18 00:42:16,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:16,215 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:16,245 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-12-18 00:42:16,435 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,SelfDestructingSolverStorable8 [2021-12-18 00:42:16,436 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1379382235, now seen corresponding path program 1 times [2021-12-18 00:42:16,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:16,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790990747] [2021-12-18 00:42:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:16,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:42:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:42:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:42:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 00:42:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:42:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-18 00:42:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2021-12-18 00:42:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-12-18 00:42:17,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:17,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790990747] [2021-12-18 00:42:17,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790990747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:17,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611546564] [2021-12-18 00:42:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:17,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:17,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:17,284 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-12-18 00:42:17,285 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-12-18 00:42:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:18,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 3159 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 00:42:18,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 21 proven. 250 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2021-12-18 00:42:18,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:42:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2021-12-18 00:42:18,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611546564] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:18,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:42:18,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18, 6] total 26 [2021-12-18 00:42:18,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91616629] [2021-12-18 00:42:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:18,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:42:18,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:18,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:42:18,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:42:18,933 INFO L87 Difference]: Start difference. First operand 328 states and 429 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 5 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (35), 5 states have call predecessors, (35), 5 states have call successors, (35) [2021-12-18 00:42:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:19,170 INFO L93 Difference]: Finished difference Result 569 states and 763 transitions. [2021-12-18 00:42:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:42:19,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 5 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (35), 5 states have call predecessors, (35), 5 states have call successors, (35) Word has length 227 [2021-12-18 00:42:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:19,173 INFO L225 Difference]: With dead ends: 569 [2021-12-18 00:42:19,173 INFO L226 Difference]: Without dead ends: 376 [2021-12-18 00:42:19,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-12-18 00:42:19,175 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 494 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:19,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 1487 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:42:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-12-18 00:42:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 338. [2021-12-18 00:42:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 214 states have (on average 1.191588785046729) internal successors, (255), 215 states have internal predecessors, (255), 92 states have call successors, (92), 31 states have call predecessors, (92), 31 states have return successors, (97), 91 states have call predecessors, (97), 90 states have call successors, (97) [2021-12-18 00:42:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 444 transitions. [2021-12-18 00:42:19,192 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 444 transitions. Word has length 227 [2021-12-18 00:42:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:19,195 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 444 transitions. [2021-12-18 00:42:19,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 5 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (35), 5 states have call predecessors, (35), 5 states have call successors, (35) [2021-12-18 00:42:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 444 transitions. [2021-12-18 00:42:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-12-18 00:42:19,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:19,198 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:19,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 00:42:19,411 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,SelfDestructingSolverStorable9 [2021-12-18 00:42:19,412 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1456283033, now seen corresponding path program 1 times [2021-12-18 00:42:19,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:19,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556871486] [2021-12-18 00:42:19,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:19,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:42:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:42:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:42:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 00:42:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:42:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-18 00:42:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2021-12-18 00:42:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-12-18 00:42:20,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556871486] [2021-12-18 00:42:20,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556871486] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840294166] [2021-12-18 00:42:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:20,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:20,245 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-12-18 00:42:20,248 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-12-18 00:42:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 3160 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 00:42:21,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-12-18 00:42:21,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:42:21,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840294166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:42:21,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:42:21,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 20 [2021-12-18 00:42:21,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292466863] [2021-12-18 00:42:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:21,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 00:42:21,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 00:42:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:42:21,336 INFO L87 Difference]: Start difference. First operand 338 states and 444 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2021-12-18 00:42:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:21,379 INFO L93 Difference]: Finished difference Result 478 states and 625 transitions. [2021-12-18 00:42:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 00:42:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 227 [2021-12-18 00:42:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:21,382 INFO L225 Difference]: With dead ends: 478 [2021-12-18 00:42:21,382 INFO L226 Difference]: Without dead ends: 338 [2021-12-18 00:42:21,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-12-18 00:42:21,383 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 32 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:21,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:42:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-12-18 00:42:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-12-18 00:42:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 214 states have (on average 1.1822429906542056) internal successors, (253), 215 states have internal predecessors, (253), 92 states have call successors, (92), 31 states have call predecessors, (92), 31 states have return successors, (97), 91 states have call predecessors, (97), 90 states have call successors, (97) [2021-12-18 00:42:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2021-12-18 00:42:21,400 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 227 [2021-12-18 00:42:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:21,400 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2021-12-18 00:42:21,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2021-12-18 00:42:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2021-12-18 00:42:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-12-18 00:42:21,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:21,404 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:21,438 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-12-18 00:42:21,619 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,SelfDestructingSolverStorable10 [2021-12-18 00:42:21,620 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:21,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -537861673, now seen corresponding path program 1 times [2021-12-18 00:42:21,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:21,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534372343] [2021-12-18 00:42:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:21,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 00:42:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 00:42:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:42:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2021-12-18 00:42:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 00:42:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 00:42:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:42:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-18 00:42:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2021-12-18 00:42:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-12-18 00:42:22,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:22,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534372343] [2021-12-18 00:42:22,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534372343] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:22,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289819654] [2021-12-18 00:42:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:22,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:22,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:22,348 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-12-18 00:42:22,350 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-12-18 00:42:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:23,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 3147 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 00:42:23,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-12-18 00:42:23,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:42:23,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289819654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:42:23,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:42:23,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2021-12-18 00:42:23,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558628486] [2021-12-18 00:42:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:23,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:42:23,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:42:23,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2021-12-18 00:42:23,449 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2021-12-18 00:42:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:23,632 INFO L93 Difference]: Finished difference Result 586 states and 779 transitions. [2021-12-18 00:42:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:42:23,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 227 [2021-12-18 00:42:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:23,635 INFO L225 Difference]: With dead ends: 586 [2021-12-18 00:42:23,635 INFO L226 Difference]: Without dead ends: 343 [2021-12-18 00:42:23,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2021-12-18 00:42:23,636 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 3 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:23,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 2213 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:42:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-18 00:42:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2021-12-18 00:42:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 216 states have (on average 1.1805555555555556) internal successors, (255), 218 states have internal predecessors, (255), 92 states have call successors, (92), 31 states have call predecessors, (92), 32 states have return successors, (102), 91 states have call predecessors, (102), 90 states have call successors, (102) [2021-12-18 00:42:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 449 transitions. [2021-12-18 00:42:23,653 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 449 transitions. Word has length 227 [2021-12-18 00:42:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:23,655 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 449 transitions. [2021-12-18 00:42:23,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2021-12-18 00:42:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 449 transitions. [2021-12-18 00:42:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-12-18 00:42:23,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:23,658 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:23,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-18 00:42:23,883 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,SelfDestructingSolverStorable11 [2021-12-18 00:42:23,884 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -886534644, now seen corresponding path program 2 times [2021-12-18 00:42:23,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:23,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833844903] [2021-12-18 00:42:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:23,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-18 00:42:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:42:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-18 00:42:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 00:42:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 00:42:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-18 00:42:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-12-18 00:42:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:42:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2021-12-18 00:42:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2021-12-18 00:42:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2021-12-18 00:42:24,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:24,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833844903] [2021-12-18 00:42:24,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833844903] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:24,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876506328] [2021-12-18 00:42:24,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:42:24,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:24,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:24,528 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-12-18 00:42:24,556 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-12-18 00:42:25,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:42:25,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:42:25,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 3201 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-18 00:42:25,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:26,204 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 15 treesize of output 7 [2021-12-18 00:42:26,209 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 15 treesize of output 7 [2021-12-18 00:42:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 175 proven. 12 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2021-12-18 00:42:26,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:42:26,781 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 00:42:26,781 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 24 treesize of output 23 [2021-12-18 00:42:26,788 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-18 00:42:26,788 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 20 treesize of output 12 [2021-12-18 00:42:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2021-12-18 00:42:27,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876506328] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:42:27,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:42:27,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 12] total 29 [2021-12-18 00:42:27,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709672358] [2021-12-18 00:42:27,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:42:27,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-18 00:42:27,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-18 00:42:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2021-12-18 00:42:27,041 INFO L87 Difference]: Start difference. First operand 341 states and 449 transitions. Second operand has 29 states, 24 states have (on average 6.708333333333333) internal successors, (161), 25 states have internal predecessors, (161), 14 states have call successors, (81), 7 states have call predecessors, (81), 7 states have return successors, (75), 9 states have call predecessors, (75), 14 states have call successors, (75) [2021-12-18 00:42:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:31,248 INFO L93 Difference]: Finished difference Result 644 states and 864 transitions. [2021-12-18 00:42:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 00:42:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 6.708333333333333) internal successors, (161), 25 states have internal predecessors, (161), 14 states have call successors, (81), 7 states have call predecessors, (81), 7 states have return successors, (75), 9 states have call predecessors, (75), 14 states have call successors, (75) Word has length 238 [2021-12-18 00:42:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:31,251 INFO L225 Difference]: With dead ends: 644 [2021-12-18 00:42:31,251 INFO L226 Difference]: Without dead ends: 408 [2021-12-18 00:42:31,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 533 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2021-12-18 00:42:31,253 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 580 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 6023 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 6834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 6023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:31,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 3439 Invalid, 6834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 6023 Invalid, 0 Unknown, 377 Unchecked, 3.4s Time] [2021-12-18 00:42:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-12-18 00:42:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 341. [2021-12-18 00:42:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 216 states have (on average 1.1805555555555556) internal successors, (255), 218 states have internal predecessors, (255), 92 states have call successors, (92), 31 states have call predecessors, (92), 32 states have return successors, (100), 91 states have call predecessors, (100), 90 states have call successors, (100) [2021-12-18 00:42:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 447 transitions. [2021-12-18 00:42:31,271 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 447 transitions. Word has length 238 [2021-12-18 00:42:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:31,271 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 447 transitions. [2021-12-18 00:42:31,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 6.708333333333333) internal successors, (161), 25 states have internal predecessors, (161), 14 states have call successors, (81), 7 states have call predecessors, (81), 7 states have return successors, (75), 9 states have call predecessors, (75), 14 states have call successors, (75) [2021-12-18 00:42:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2021-12-18 00:42:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-12-18 00:42:31,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:31,273 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:31,307 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-12-18 00:42:31,490 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,SelfDestructingSolverStorable12 [2021-12-18 00:42:31,491 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash 657431595, now seen corresponding path program 3 times [2021-12-18 00:42:31,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:31,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123768885] [2021-12-18 00:42:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:31,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:42:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:32,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:42:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:42:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:42:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:42:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:42:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:42:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:42:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:42:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:42:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:42:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:42:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:42:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:42:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:42:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:42:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 00:42:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-18 00:42:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-18 00:42:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:42:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-18 00:42:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:42:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-18 00:42:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-12-18 00:42:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-18 00:42:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-18 00:42:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:42:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:42:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:42:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 00:42:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-18 00:42:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2021-12-18 00:42:33,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:33,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123768885] [2021-12-18 00:42:33,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123768885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:33,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830731645] [2021-12-18 00:42:33,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 00:42:33,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:33,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:33,840 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-12-18 00:42:33,863 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-12-18 00:42:40,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-18 00:42:40,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:42:40,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 3090 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 00:42:40,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2021-12-18 00:42:40,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:42:40,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830731645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:42:40,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:42:40,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [38] total 42 [2021-12-18 00:42:40,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380294379] [2021-12-18 00:42:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:42:40,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:42:40,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:42:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1607, Unknown=0, NotChecked=0, Total=1722 [2021-12-18 00:42:40,723 INFO L87 Difference]: Start difference. First operand 341 states and 447 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2021-12-18 00:42:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:42:40,900 INFO L93 Difference]: Finished difference Result 637 states and 840 transitions. [2021-12-18 00:42:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:42:40,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 249 [2021-12-18 00:42:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:42:40,903 INFO L225 Difference]: With dead ends: 637 [2021-12-18 00:42:40,903 INFO L226 Difference]: Without dead ends: 343 [2021-12-18 00:42:40,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2021-12-18 00:42:40,905 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 3 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:42:40,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1828 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:42:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-18 00:42:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 336. [2021-12-18 00:42:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 212 states have (on average 1.1745283018867925) internal successors, (249), 214 states have internal predecessors, (249), 92 states have call successors, (92), 31 states have call predecessors, (92), 31 states have return successors, (99), 90 states have call predecessors, (99), 90 states have call successors, (99) [2021-12-18 00:42:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 440 transitions. [2021-12-18 00:42:40,923 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 440 transitions. Word has length 249 [2021-12-18 00:42:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:42:40,923 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 440 transitions. [2021-12-18 00:42:40,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2021-12-18 00:42:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2021-12-18 00:42:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-12-18 00:42:40,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:42:40,925 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:42:40,967 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-12-18 00:42:41,129 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,SelfDestructingSolverStorable13 [2021-12-18 00:42:41,130 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:42:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:42:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash -610453804, now seen corresponding path program 1 times [2021-12-18 00:42:41,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:42:41,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762488894] [2021-12-18 00:42:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:41,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:42:41,203 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:42:41,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129271668] [2021-12-18 00:42:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:42:41,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:42:41,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:42:41,205 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-12-18 00:42:41,207 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-12-18 00:42:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:42:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 3352 conjuncts, 291 conjunts are in the unsatisfiable core [2021-12-18 00:42:42,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:42:42,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:42:42,616 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:42:42,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:42:42,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:42:43,203 INFO L354 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2021-12-18 00:42:43,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 186 [2021-12-18 00:42:43,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:42:43,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:43,581 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:42:43,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-12-18 00:42:43,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:42:43,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-18 00:42:43,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:42:44,305 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:42:44,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 00:42:44,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:44,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 00:42:44,641 INFO L354 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2021-12-18 00:42:44,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 353 treesize of output 280 [2021-12-18 00:42:44,693 INFO L354 Elim1Store]: treesize reduction 86, result has 21.1 percent of original size [2021-12-18 00:42:44,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 420 treesize of output 349 [2021-12-18 00:42:44,738 INFO L354 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2021-12-18 00:42:44,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 363 [2021-12-18 00:42:44,750 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 00:42:44,751 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 420 treesize of output 355 [2021-12-18 00:42:44,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:44,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:44,791 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-12-18 00:42:44,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 207 [2021-12-18 00:42:44,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:44,857 INFO L354 Elim1Store]: treesize reduction 81, result has 40.0 percent of original size [2021-12-18 00:42:44,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 225 [2021-12-18 00:42:44,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:44,905 INFO L354 Elim1Store]: treesize reduction 70, result has 37.5 percent of original size [2021-12-18 00:42:44,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 134 treesize of output 179 [2021-12-18 00:42:44,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 130 treesize of output 116 [2021-12-18 00:42:44,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 125 treesize of output 107 [2021-12-18 00:42:44,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-12-18 00:42:44,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:44,980 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-18 00:42:44,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 70 [2021-12-18 00:42:45,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:42:45,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:42:45,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-12-18 00:42:46,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 3 [2021-12-18 00:42:46,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:46,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 00:42:46,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:46,128 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:46,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2021-12-18 00:42:46,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2021-12-18 00:42:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:46,250 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:46,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-12-18 00:42:46,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:46,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:46,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-18 00:42:46,359 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-18 00:42:46,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:46,437 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:46,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 101 [2021-12-18 00:42:46,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:42:46,748 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:46,749 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 23 treesize of output 27 [2021-12-18 00:42:46,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:46,983 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:46,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 87 [2021-12-18 00:42:47,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 3 [2021-12-18 00:42:47,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:47,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 00:42:47,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:47,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:47,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 97 [2021-12-18 00:42:47,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 3 [2021-12-18 00:42:47,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:47,265 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:42:47,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 107 [2021-12-18 00:42:47,507 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:42:47,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 00:42:47,522 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:42:47,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 00:42:47,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:42:47,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 00:42:48,062 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:42:48,062 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 24 treesize of output 28 [2021-12-18 00:42:48,078 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:42:48,078 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 14 treesize of output 20 [2021-12-18 00:42:48,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-18 00:42:48,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 10 [2021-12-18 00:42:48,249 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-12-18 00:42:48,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 42 [2021-12-18 00:42:52,370 INFO L354 Elim1Store]: treesize reduction 68, result has 23.6 percent of original size [2021-12-18 00:42:52,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 39 [2021-12-18 00:42:52,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-12-18 00:42:52,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-18 00:42:52,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-18 00:42:52,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2021-12-18 00:42:53,600 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| Int) (|v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base|) 0))) (and (or (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_15|) 0) 0)) (not (= .cse0 0))) (not (= |ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| |v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_15|) 0) .cse0)))) is different from true [2021-12-18 00:42:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 90 proven. 318 refuted. 0 times theorem prover too weak. 129 trivial. 3 not checked. [2021-12-18 00:42:57,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:42:58,831 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_9543 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_9543) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|)))) (forall ((v_ArrVal_9542 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_9542) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|))))) is different from false [2021-12-18 00:42:58,891 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_9543 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.offset| |c_ULTIMATE.start_aws_hash_table_remove_~state~8#1.base|)) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_9543) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|)))) (forall ((v_ArrVal_9542 (Array Int Int)) (v_ArrVal_9549 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| v_ArrVal_9549) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_9542) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|))))) is different from false [2021-12-18 00:42:58,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:42:58,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762488894] [2021-12-18 00:42:58,893 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:42:58,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129271668] [2021-12-18 00:42:58,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129271668] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:42:58,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:42:58,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2021-12-18 00:42:58,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453356501] [2021-12-18 00:42:58,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:42:58,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-18 00:42:58,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:42:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-18 00:42:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2079, Unknown=4, NotChecked=282, Total=2550 [2021-12-18 00:42:58,898 INFO L87 Difference]: Start difference. First operand 336 states and 440 transitions. Second operand has 44 states, 40 states have (on average 3.2) internal successors, (128), 40 states have internal predecessors, (128), 22 states have call successors, (40), 10 states have call predecessors, (40), 13 states have return successors, (39), 22 states have call predecessors, (39), 21 states have call successors, (39) [2021-12-18 00:43:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:43:00,361 INFO L93 Difference]: Finished difference Result 574 states and 717 transitions. [2021-12-18 00:43:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-18 00:43:00,362 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 3.2) internal successors, (128), 40 states have internal predecessors, (128), 22 states have call successors, (40), 10 states have call predecessors, (40), 13 states have return successors, (39), 22 states have call predecessors, (39), 21 states have call successors, (39) Word has length 255 [2021-12-18 00:43:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:43:00,364 INFO L225 Difference]: With dead ends: 574 [2021-12-18 00:43:00,365 INFO L226 Difference]: Without dead ends: 496 [2021-12-18 00:43:00,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 185 SyntacticMatches, 42 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=283, Invalid=3385, Unknown=4, NotChecked=360, Total=4032 [2021-12-18 00:43:00,367 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 414 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5228 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:43:00,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 2353 Invalid, 6219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 714 Invalid, 0 Unknown, 5228 Unchecked, 0.8s Time] [2021-12-18 00:43:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-12-18 00:43:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 478. [2021-12-18 00:43:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 304 states have (on average 1.1414473684210527) internal successors, (347), 309 states have internal predecessors, (347), 121 states have call successors, (121), 48 states have call predecessors, (121), 52 states have return successors, (135), 120 states have call predecessors, (135), 119 states have call successors, (135) [2021-12-18 00:43:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 603 transitions. [2021-12-18 00:43:00,396 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 603 transitions. Word has length 255 [2021-12-18 00:43:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:43:00,396 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 603 transitions. [2021-12-18 00:43:00,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 3.2) internal successors, (128), 40 states have internal predecessors, (128), 22 states have call successors, (40), 10 states have call predecessors, (40), 13 states have return successors, (39), 22 states have call predecessors, (39), 21 states have call successors, (39) [2021-12-18 00:43:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 603 transitions. [2021-12-18 00:43:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-12-18 00:43:00,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:43:00,399 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:43:00,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 00:43:00,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:43:00,624 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:43:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:43:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash -726118166, now seen corresponding path program 1 times [2021-12-18 00:43:00,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:43:00,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661846188] [2021-12-18 00:43:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:43:00,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:43:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:43:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:43:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:43:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:43:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:43:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:43:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:43:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:43:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:43:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:43:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:43:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:43:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:43:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:43:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:43:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:43:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:43:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:43:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 00:43:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:43:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 00:43:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 00:43:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-18 00:43:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 00:43:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 00:43:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:43:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:43:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 00:43:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-18 00:43:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-18 00:43:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-18 00:43:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:43:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:43:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-12-18 00:43:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-18 00:43:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-18 00:43:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-18 00:43:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:43:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:43:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:43:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-18 00:43:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-18 00:43:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-12-18 00:43:01,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:43:01,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661846188] [2021-12-18 00:43:01,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661846188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:43:01,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:43:01,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:43:01,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062623125] [2021-12-18 00:43:01,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:43:01,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:43:01,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:43:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:43:01,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:43:01,240 INFO L87 Difference]: Start difference. First operand 478 states and 603 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (37), 4 states have call predecessors, (37), 2 states have call successors, (37) [2021-12-18 00:43:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:43:02,366 INFO L93 Difference]: Finished difference Result 794 states and 1015 transitions. [2021-12-18 00:43:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:43:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (37), 4 states have call predecessors, (37), 2 states have call successors, (37) Word has length 261 [2021-12-18 00:43:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:43:02,369 INFO L225 Difference]: With dead ends: 794 [2021-12-18 00:43:02,369 INFO L226 Difference]: Without dead ends: 470 [2021-12-18 00:43:02,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-12-18 00:43:02,371 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 529 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:43:02,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1552 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 00:43:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-12-18 00:43:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2021-12-18 00:43:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 299 states have (on average 1.140468227424749) internal successors, (341), 303 states have internal predecessors, (341), 119 states have call successors, (119), 48 states have call predecessors, (119), 51 states have return successors, (131), 118 states have call predecessors, (131), 117 states have call successors, (131) [2021-12-18 00:43:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 591 transitions. [2021-12-18 00:43:02,395 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 591 transitions. Word has length 261 [2021-12-18 00:43:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:43:02,395 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 591 transitions. [2021-12-18 00:43:02,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (38), 6 states have call predecessors, (38), 4 states have return successors, (37), 4 states have call predecessors, (37), 2 states have call successors, (37) [2021-12-18 00:43:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 591 transitions. [2021-12-18 00:43:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-12-18 00:43:02,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:43:02,397 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:43:02,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 00:43:02,398 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:43:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:43:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1942128538, now seen corresponding path program 1 times [2021-12-18 00:43:02,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:43:02,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738907565] [2021-12-18 00:43:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:43:02,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:43:02,462 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:43:02,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224222294] [2021-12-18 00:43:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:43:02,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:43:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:43:02,468 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-12-18 00:43:02,471 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-12-18 00:43:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:43:03,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 3361 conjuncts, 263 conjunts are in the unsatisfiable core [2021-12-18 00:43:03,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:43:03,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:43:04,069 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:43:04,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:43:04,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-18 00:43:04,418 INFO L354 Elim1Store]: treesize reduction 123, result has 21.7 percent of original size [2021-12-18 00:43:04,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 117 treesize of output 130 [2021-12-18 00:43:04,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-18 00:43:04,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:04,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 00:43:04,604 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 11 treesize of output 7 [2021-12-18 00:43:04,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 00:43:05,076 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:43:05,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 00:43:05,289 INFO L354 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2021-12-18 00:43:05,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 189 [2021-12-18 00:43:05,297 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 00:43:05,297 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 189 [2021-12-18 00:43:05,341 INFO L354 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2021-12-18 00:43:05,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 223 [2021-12-18 00:43:05,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:05,410 INFO L354 Elim1Store]: treesize reduction 90, result has 42.7 percent of original size [2021-12-18 00:43:05,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 236 [2021-12-18 00:43:05,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:05,444 INFO L354 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2021-12-18 00:43:05,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 154 [2021-12-18 00:43:05,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:05,458 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 97 treesize of output 81 [2021-12-18 00:43:05,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:43:05,475 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 00:43:05,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2021-12-18 00:43:05,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 107 treesize of output 93 [2021-12-18 00:43:05,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-18 00:43:05,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-18 00:43:06,445 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:06,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:06,489 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 00:43:06,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 123 [2021-12-18 00:43:06,516 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:06,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:06,532 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:06,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:06,569 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:06,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:06,714 INFO L354 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2021-12-18 00:43:06,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 1 [2021-12-18 00:43:06,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:06,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2021-12-18 00:43:06,792 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:06,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:06,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:06,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:06,825 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:43:06,825 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 1 case distinctions, treesize of input 45 treesize of output 41 [2021-12-18 00:43:06,840 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:06,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:06,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:06,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-18 00:43:06,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:06,981 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:43:06,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 215 [2021-12-18 00:43:07,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:43:07,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:43:07,496 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:43:07,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 427 treesize of output 405 [2021-12-18 00:43:14,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:43:14,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:43:14,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:43:14,570 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:43:14,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 7 [2021-12-18 00:43:14,772 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:43:14,772 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 31 treesize of output 29 [2021-12-18 00:43:14,786 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:43:14,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 00:43:15,264 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 00:43:15,265 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 29 treesize of output 28 [2021-12-18 00:43:15,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:43:15,401 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-12-18 00:43:15,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 42 [2021-12-18 00:43:19,755 INFO L354 Elim1Store]: treesize reduction 64, result has 34.0 percent of original size [2021-12-18 00:43:19,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 35 treesize of output 55 [2021-12-18 00:43:20,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-12-18 00:43:20,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-18 00:43:20,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2021-12-18 00:43:20,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-18 00:43:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 82 proven. 321 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-18 00:43:52,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:43:52,944 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_10681 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_10681) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|)))) (forall ((v_ArrVal_10682 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_10682) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0)))) is different from false [2021-12-18 00:43:53,004 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_10681 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.offset| |c_ULTIMATE.start_aws_hash_table_remove_~state~8#1.base|)) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_10681) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|)))) (forall ((v_ArrVal_10687 (Array Int Int)) (v_ArrVal_10682 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| v_ArrVal_10687) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_10682) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0)))) is different from false [2021-12-18 00:43:53,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:43:53,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738907565] [2021-12-18 00:43:53,005 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:43:53,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224222294] [2021-12-18 00:43:53,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224222294] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:43:53,006 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:43:53,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2021-12-18 00:43:53,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649500383] [2021-12-18 00:43:53,006 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:43:53,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 00:43:53,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:43:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 00:43:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2060, Unknown=21, NotChecked=186, Total=2450 [2021-12-18 00:43:53,008 INFO L87 Difference]: Start difference. First operand 470 states and 591 transitions. Second operand has 43 states, 38 states have (on average 3.289473684210526) internal successors, (125), 39 states have internal predecessors, (125), 22 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 22 states have call predecessors, (39), 21 states have call successors, (39) [2021-12-18 00:44:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:44:16,619 INFO L93 Difference]: Finished difference Result 654 states and 818 transitions. [2021-12-18 00:44:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-18 00:44:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 3.289473684210526) internal successors, (125), 39 states have internal predecessors, (125), 22 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 22 states have call predecessors, (39), 21 states have call successors, (39) Word has length 255 [2021-12-18 00:44:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:44:16,623 INFO L225 Difference]: With dead ends: 654 [2021-12-18 00:44:16,623 INFO L226 Difference]: Without dead ends: 576 [2021-12-18 00:44:16,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 184 SyntacticMatches, 42 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=285, Invalid=3597, Unknown=32, NotChecked=246, Total=4160 [2021-12-18 00:44:16,625 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 370 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 7994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5586 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:44:16,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 2767 Invalid, 7994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 2144 Invalid, 0 Unknown, 5586 Unchecked, 1.8s Time] [2021-12-18 00:44:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-12-18 00:44:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 552. [2021-12-18 00:44:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 349 states have (on average 1.1318051575931232) internal successors, (395), 354 states have internal predecessors, (395), 142 states have call successors, (142), 57 states have call predecessors, (142), 60 states have return successors, (156), 140 states have call predecessors, (156), 140 states have call successors, (156) [2021-12-18 00:44:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 693 transitions. [2021-12-18 00:44:16,659 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 693 transitions. Word has length 255 [2021-12-18 00:44:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:44:16,660 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 693 transitions. [2021-12-18 00:44:16,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 3.289473684210526) internal successors, (125), 39 states have internal predecessors, (125), 22 states have call successors, (40), 9 states have call predecessors, (40), 12 states have return successors, (39), 22 states have call predecessors, (39), 21 states have call successors, (39) [2021-12-18 00:44:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 693 transitions. [2021-12-18 00:44:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-12-18 00:44:16,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:44:16,663 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:44:16,699 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-12-18 00:44:16,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 00:44:16,888 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:44:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:44:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1313324520, now seen corresponding path program 1 times [2021-12-18 00:44:16,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:44:16,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817629047] [2021-12-18 00:44:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:16,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:44:16,953 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:44:16,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446904231] [2021-12-18 00:44:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:16,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:44:16,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:44:16,955 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-12-18 00:44:16,987 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-12-18 00:44:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:17,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 3356 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 00:44:17,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:44:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-12-18 00:44:18,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:44:18,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:44:18,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817629047] [2021-12-18 00:44:18,259 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:44:18,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446904231] [2021-12-18 00:44:18,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446904231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:44:18,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:44:18,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 00:44:18,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320322010] [2021-12-18 00:44:18,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:44:18,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:44:18,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:44:18,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:44:18,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:44:18,261 INFO L87 Difference]: Start difference. First operand 552 states and 693 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (37), 4 states have call predecessors, (37), 2 states have call successors, (37) [2021-12-18 00:44:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:44:18,305 INFO L93 Difference]: Finished difference Result 781 states and 990 transitions. [2021-12-18 00:44:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:44:18,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (37), 4 states have call predecessors, (37), 2 states have call successors, (37) Word has length 261 [2021-12-18 00:44:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:44:18,308 INFO L225 Difference]: With dead ends: 781 [2021-12-18 00:44:18,309 INFO L226 Difference]: Without dead ends: 474 [2021-12-18 00:44:18,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:44:18,310 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 2 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:44:18,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2375 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:44:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-12-18 00:44:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-12-18 00:44:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 305 states have (on average 1.1311475409836065) internal successors, (345), 309 states have internal predecessors, (345), 114 states have call successors, (114), 52 states have call predecessors, (114), 54 states have return successors, (126), 112 states have call predecessors, (126), 112 states have call successors, (126) [2021-12-18 00:44:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 585 transitions. [2021-12-18 00:44:18,354 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 585 transitions. Word has length 261 [2021-12-18 00:44:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:44:18,355 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 585 transitions. [2021-12-18 00:44:18,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (37), 4 states have call predecessors, (37), 2 states have call successors, (37) [2021-12-18 00:44:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 585 transitions. [2021-12-18 00:44:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-12-18 00:44:18,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:44:18,357 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:44:18,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-12-18 00:44:18,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 00:44:18,584 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:44:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:44:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 836127062, now seen corresponding path program 1 times [2021-12-18 00:44:18,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:44:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823907875] [2021-12-18 00:44:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:18,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:44:18,640 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:44:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692559062] [2021-12-18 00:44:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:44:18,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:44:18,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:44:18,642 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-12-18 00:44:18,654 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-12-18 00:44:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:44:19,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 3353 conjuncts, 289 conjunts are in the unsatisfiable core [2021-12-18 00:44:19,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:44:19,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:44:20,183 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:44:20,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:44:20,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-18 00:44:20,602 INFO L354 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2021-12-18 00:44:20,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 142 treesize of output 166 [2021-12-18 00:44:20,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-18 00:44:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:20,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 00:44:20,876 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 11 treesize of output 7 [2021-12-18 00:44:20,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:44:20,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 00:44:21,712 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:44:21,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-18 00:44:21,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:21,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 00:44:22,064 INFO L354 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2021-12-18 00:44:22,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 351 treesize of output 278 [2021-12-18 00:44:22,075 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 00:44:22,075 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 278 [2021-12-18 00:44:22,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:22,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:22,127 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-12-18 00:44:22,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 263 [2021-12-18 00:44:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:22,187 INFO L354 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2021-12-18 00:44:22,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 271 [2021-12-18 00:44:22,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:22,272 INFO L354 Elim1Store]: treesize reduction 126, result has 37.0 percent of original size [2021-12-18 00:44:22,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 181 [2021-12-18 00:44:22,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:22,344 INFO L354 Elim1Store]: treesize reduction 90, result has 42.7 percent of original size [2021-12-18 00:44:22,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 218 [2021-12-18 00:44:22,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 128 treesize of output 110 [2021-12-18 00:44:22,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 147 treesize of output 137 [2021-12-18 00:44:22,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:22,405 INFO L354 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2021-12-18 00:44:22,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 130 [2021-12-18 00:44:22,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:44:22,434 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-18 00:44:22,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2021-12-18 00:44:22,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2021-12-18 00:44:22,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:44:22,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:44:22,543 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-18 00:44:22,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 7 [2021-12-18 00:44:23,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:23,875 INFO L354 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2021-12-18 00:44:23,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 93 [2021-12-18 00:44:24,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:24,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:44:24,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2021-12-18 00:44:24,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:24,137 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:44:24,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2021-12-18 00:44:24,250 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-18 00:44:24,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 7 [2021-12-18 00:44:24,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:24,305 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:44:24,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 82 [2021-12-18 00:44:24,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:24,451 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:44:24,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 108 [2021-12-18 00:44:24,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:44:24,578 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:44:24,579 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 23 treesize of output 27 [2021-12-18 00:44:24,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:44:24,813 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:44:24,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:44:24,830 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:44:24,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2021-12-18 00:44:24,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:44:24,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:44:25,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 00:44:25,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:44:26,436 INFO L354 Elim1Store]: treesize reduction 166, result has 18.2 percent of original size [2021-12-18 00:44:26,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 58 [2021-12-18 00:44:43,831 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-18 00:44:43,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 00:44:44,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2021-12-18 00:44:44,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:44:44,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2021-12-18 00:44:44,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:44:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 110 proven. 291 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-12-18 00:44:59,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:45:00,179 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_12135 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_12135) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0))) (forall ((v_ArrVal_12136 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_12136) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0)))) is different from false [2021-12-18 00:45:00,237 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_12136 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.offset| |c_ULTIMATE.start_aws_hash_table_remove_~state~8#1.base|)) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_12136) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0))) (forall ((v_ArrVal_12135 (Array Int Int)) (v_ArrVal_12142 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| v_ArrVal_12142) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_12135) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0)))) is different from false [2021-12-18 00:45:00,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:45:00,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823907875] [2021-12-18 00:45:00,238 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:45:00,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692559062] [2021-12-18 00:45:00,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692559062] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:45:00,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:45:00,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2021-12-18 00:45:00,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373943370] [2021-12-18 00:45:00,239 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:45:00,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 00:45:00,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:45:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 00:45:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2076, Unknown=14, NotChecked=186, Total=2450 [2021-12-18 00:45:00,241 INFO L87 Difference]: Start difference. First operand 474 states and 585 transitions. Second operand has 43 states, 40 states have (on average 3.2) internal successors, (128), 40 states have internal predecessors, (128), 21 states have call successors, (40), 9 states have call predecessors, (40), 11 states have return successors, (39), 21 states have call predecessors, (39), 20 states have call successors, (39) [2021-12-18 00:45:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:45:08,139 INFO L93 Difference]: Finished difference Result 617 states and 749 transitions. [2021-12-18 00:45:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-18 00:45:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 3.2) internal successors, (128), 40 states have internal predecessors, (128), 21 states have call successors, (40), 9 states have call predecessors, (40), 11 states have return successors, (39), 21 states have call predecessors, (39), 20 states have call successors, (39) Word has length 255 [2021-12-18 00:45:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:45:08,142 INFO L225 Difference]: With dead ends: 617 [2021-12-18 00:45:08,143 INFO L226 Difference]: Without dead ends: 543 [2021-12-18 00:45:08,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 183 SyntacticMatches, 48 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=278, Invalid=3617, Unknown=19, NotChecked=246, Total=4160 [2021-12-18 00:45:08,145 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 309 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 8513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7073 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:45:08,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 2813 Invalid, 8513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1206 Invalid, 0 Unknown, 7073 Unchecked, 1.6s Time] [2021-12-18 00:45:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-12-18 00:45:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 440. [2021-12-18 00:45:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 287 states have (on average 1.132404181184669) internal successors, (325), 290 states have internal predecessors, (325), 100 states have call successors, (100), 50 states have call predecessors, (100), 52 states have return successors, (111), 99 states have call predecessors, (111), 98 states have call successors, (111) [2021-12-18 00:45:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 536 transitions. [2021-12-18 00:45:08,172 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 536 transitions. Word has length 255 [2021-12-18 00:45:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:45:08,173 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 536 transitions. [2021-12-18 00:45:08,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 3.2) internal successors, (128), 40 states have internal predecessors, (128), 21 states have call successors, (40), 9 states have call predecessors, (40), 11 states have return successors, (39), 21 states have call predecessors, (39), 20 states have call successors, (39) [2021-12-18 00:45:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 536 transitions. [2021-12-18 00:45:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-12-18 00:45:08,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:45:08,175 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:45:08,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-18 00:45:08,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:08,399 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:45:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:45:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1121421696, now seen corresponding path program 1 times [2021-12-18 00:45:08,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:45:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916196902] [2021-12-18 00:45:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:08,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:45:08,455 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:45:08,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685219789] [2021-12-18 00:45:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:08,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:08,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:45:08,457 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-12-18 00:45:08,478 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-12-18 00:45:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:45:09,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 3356 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 00:45:09,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:45:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2021-12-18 00:45:09,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:45:09,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:45:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916196902] [2021-12-18 00:45:09,703 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:45:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685219789] [2021-12-18 00:45:09,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685219789] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:45:09,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:45:09,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 00:45:09,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272615844] [2021-12-18 00:45:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:45:09,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 00:45:09,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:45:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 00:45:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:45:09,705 INFO L87 Difference]: Start difference. First operand 440 states and 536 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2021-12-18 00:45:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:45:09,734 INFO L93 Difference]: Finished difference Result 584 states and 725 transitions. [2021-12-18 00:45:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 00:45:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 257 [2021-12-18 00:45:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:45:09,737 INFO L225 Difference]: With dead ends: 584 [2021-12-18 00:45:09,737 INFO L226 Difference]: Without dead ends: 441 [2021-12-18 00:45:09,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:45:09,738 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 0 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:45:09,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 773 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:45:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-12-18 00:45:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2021-12-18 00:45:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 288 states have (on average 1.1319444444444444) internal successors, (326), 291 states have internal predecessors, (326), 100 states have call successors, (100), 50 states have call predecessors, (100), 52 states have return successors, (111), 99 states have call predecessors, (111), 98 states have call successors, (111) [2021-12-18 00:45:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 537 transitions. [2021-12-18 00:45:09,764 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 537 transitions. Word has length 257 [2021-12-18 00:45:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:45:09,764 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 537 transitions. [2021-12-18 00:45:09,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2021-12-18 00:45:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 537 transitions. [2021-12-18 00:45:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-12-18 00:45:09,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:45:09,766 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:45:09,799 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-12-18 00:45:09,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:09,992 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:45:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:45:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 391545573, now seen corresponding path program 1 times [2021-12-18 00:45:09,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:45:09,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079204363] [2021-12-18 00:45:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:09,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:45:10,051 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:45:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681000403] [2021-12-18 00:45:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:10,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:10,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:45:10,053 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-12-18 00:45:10,065 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-12-18 00:45:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:45:11,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 3468 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 00:45:11,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:45:11,285 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 7 treesize of output 3 [2021-12-18 00:45:11,287 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 7 treesize of output 3 [2021-12-18 00:45:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 84 proven. 2 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2021-12-18 00:45:11,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:45:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2021-12-18 00:45:12,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:45:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079204363] [2021-12-18 00:45:12,073 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:45:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681000403] [2021-12-18 00:45:12,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681000403] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:45:12,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:45:12,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 16 [2021-12-18 00:45:12,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941702759] [2021-12-18 00:45:12,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:45:12,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 00:45:12,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:45:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 00:45:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:45:12,075 INFO L87 Difference]: Start difference. First operand 441 states and 537 transitions. Second operand has 16 states, 13 states have (on average 8.23076923076923) internal successors, (107), 14 states have internal predecessors, (107), 9 states have call successors, (44), 4 states have call predecessors, (44), 5 states have return successors, (39), 5 states have call predecessors, (39), 7 states have call successors, (39) [2021-12-18 00:45:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:45:12,405 INFO L93 Difference]: Finished difference Result 634 states and 798 transitions. [2021-12-18 00:45:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 00:45:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.23076923076923) internal successors, (107), 14 states have internal predecessors, (107), 9 states have call successors, (44), 4 states have call predecessors, (44), 5 states have return successors, (39), 5 states have call predecessors, (39), 7 states have call successors, (39) Word has length 266 [2021-12-18 00:45:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:45:12,408 INFO L225 Difference]: With dead ends: 634 [2021-12-18 00:45:12,408 INFO L226 Difference]: Without dead ends: 445 [2021-12-18 00:45:12,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 514 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:45:12,409 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 147 mSDsluCounter, 3139 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 3506 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:45:12,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 3506 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:45:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-12-18 00:45:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 441. [2021-12-18 00:45:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 288 states have (on average 1.1319444444444444) internal successors, (326), 291 states have internal predecessors, (326), 100 states have call successors, (100), 50 states have call predecessors, (100), 52 states have return successors, (109), 99 states have call predecessors, (109), 98 states have call successors, (109) [2021-12-18 00:45:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 535 transitions. [2021-12-18 00:45:12,440 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 535 transitions. Word has length 266 [2021-12-18 00:45:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:45:12,441 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 535 transitions. [2021-12-18 00:45:12,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.23076923076923) internal successors, (107), 14 states have internal predecessors, (107), 9 states have call successors, (44), 4 states have call predecessors, (44), 5 states have return successors, (39), 5 states have call predecessors, (39), 7 states have call successors, (39) [2021-12-18 00:45:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 535 transitions. [2021-12-18 00:45:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-12-18 00:45:12,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:45:12,443 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:45:12,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-18 00:45:12,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:12,659 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:45:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:45:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -846054354, now seen corresponding path program 1 times [2021-12-18 00:45:12,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:45:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519462741] [2021-12-18 00:45:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:12,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:45:12,712 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:45:12,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886954858] [2021-12-18 00:45:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:12,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:12,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:45:12,713 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-12-18 00:45:12,714 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-12-18 00:45:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:45:13,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 3421 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 00:45:13,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:45:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2021-12-18 00:45:14,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:45:14,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:45:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519462741] [2021-12-18 00:45:14,054 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:45:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886954858] [2021-12-18 00:45:14,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886954858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:45:14,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:45:14,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:45:14,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449630346] [2021-12-18 00:45:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:45:14,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:45:14,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:45:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:45:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:45:14,056 INFO L87 Difference]: Start difference. First operand 441 states and 535 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2021-12-18 00:45:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:45:14,108 INFO L93 Difference]: Finished difference Result 586 states and 725 transitions. [2021-12-18 00:45:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:45:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 261 [2021-12-18 00:45:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:45:14,111 INFO L225 Difference]: With dead ends: 586 [2021-12-18 00:45:14,111 INFO L226 Difference]: Without dead ends: 443 [2021-12-18 00:45:14,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 257 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-12-18 00:45:14,112 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 43 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:45:14,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 1491 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:45:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-12-18 00:45:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2021-12-18 00:45:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 288 states have (on average 1.1284722222222223) internal successors, (325), 291 states have internal predecessors, (325), 100 states have call successors, (100), 50 states have call predecessors, (100), 52 states have return successors, (109), 99 states have call predecessors, (109), 98 states have call successors, (109) [2021-12-18 00:45:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 534 transitions. [2021-12-18 00:45:14,138 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 534 transitions. Word has length 261 [2021-12-18 00:45:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:45:14,138 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 534 transitions. [2021-12-18 00:45:14,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2021-12-18 00:45:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 534 transitions. [2021-12-18 00:45:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-12-18 00:45:14,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:45:14,140 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:45:14,172 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-12-18 00:45:14,363 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,SelfDestructingSolverStorable21 [2021-12-18 00:45:14,364 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:45:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:45:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1759969200, now seen corresponding path program 1 times [2021-12-18 00:45:14,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:45:14,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318930985] [2021-12-18 00:45:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:14,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:45:14,420 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:45:14,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392969599] [2021-12-18 00:45:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:45:14,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:45:14,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:45:14,422 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-12-18 00:45:14,452 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-12-18 00:45:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:45:15,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 3408 conjuncts, 321 conjunts are in the unsatisfiable core [2021-12-18 00:45:15,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:45:15,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:45:16,130 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:45:16,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:45:16,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:45:16,683 INFO L354 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2021-12-18 00:45:16,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 134 [2021-12-18 00:45:17,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:45:17,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:17,143 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:45:17,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-12-18 00:45:17,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:45:17,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:45:17,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-18 00:45:18,067 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:45:18,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 00:45:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 00:45:18,560 INFO L354 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2021-12-18 00:45:18,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 353 treesize of output 280 [2021-12-18 00:45:18,607 INFO L354 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2021-12-18 00:45:18,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 331 treesize of output 304 [2021-12-18 00:45:18,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,659 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-12-18 00:45:18,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 262 [2021-12-18 00:45:18,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,706 INFO L354 Elim1Store]: treesize reduction 19, result has 48.6 percent of original size [2021-12-18 00:45:18,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 244 treesize of output 244 [2021-12-18 00:45:18,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,874 INFO L354 Elim1Store]: treesize reduction 87, result has 38.3 percent of original size [2021-12-18 00:45:18,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 170 [2021-12-18 00:45:18,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 114 treesize of output 100 [2021-12-18 00:45:18,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,952 INFO L354 Elim1Store]: treesize reduction 70, result has 37.5 percent of original size [2021-12-18 00:45:18,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 134 treesize of output 179 [2021-12-18 00:45:18,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-12-18 00:45:18,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:18,996 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-12-18 00:45:18,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 86 [2021-12-18 00:45:19,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 110 treesize of output 96 [2021-12-18 00:45:19,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:19,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2021-12-18 00:45:19,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:45:19,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2021-12-18 00:45:19,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2021-12-18 00:45:19,977 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:45:19,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 33 [2021-12-18 00:45:20,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:20,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-18 00:45:20,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:20,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-18 00:45:20,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:20,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:20,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:20,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2021-12-18 00:45:20,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:20,301 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:45:20,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 00:45:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:21,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:45:21,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 76 [2021-12-18 00:45:21,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 3 [2021-12-18 00:45:21,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:21,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 00:45:21,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:21,690 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:45:21,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2021-12-18 00:45:21,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:21,762 INFO L354 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2021-12-18 00:45:21,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 71 [2021-12-18 00:45:21,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:21,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:45:21,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 58 [2021-12-18 00:45:22,091 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:45:22,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-18 00:45:22,106 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:45:22,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 00:45:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:45:22,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 00:45:22,829 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:45:22,829 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 14 treesize of output 20 [2021-12-18 00:45:22,843 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:45:22,843 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 24 treesize of output 28 [2021-12-18 00:45:22,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 10 [2021-12-18 00:45:22,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-18 00:45:23,006 INFO L354 Elim1Store]: treesize reduction 109, result has 18.0 percent of original size [2021-12-18 00:45:23,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 42 [2021-12-18 00:45:41,300 INFO L354 Elim1Store]: treesize reduction 68, result has 23.6 percent of original size [2021-12-18 00:45:41,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 39 [2021-12-18 00:45:41,674 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|s_find_entry_s_find_entry1_~p_entry#1.offset| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_s_find_entry_#in~p_entry#1.base| (store (select |c_old(#memory_$Pointer$.base)| |c_s_find_entry_#in~p_entry#1.base|) |s_find_entry_s_find_entry1_~p_entry#1.offset| |c_s_find_entry_#in~state#1.base|)))) (exists ((v_ArrVal_14974 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_s_find_entry_#in~p_entry#1.base| v_ArrVal_14974)))) is different from true [2021-12-18 00:45:41,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-12-18 00:45:41,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-18 00:45:41,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2021-12-18 00:45:41,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-18 00:45:43,027 WARN L860 $PredicateComparison]: unable to prove that (exists ((|s_find_entry_s_find_entry1_~p_entry#1.offset| Int) (|ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| Int) (|v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_40| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base|) |s_find_entry_s_find_entry1_~p_entry#1.offset|))) (and (or (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_40|) 0) 0)) (not (= .cse0 0))) (not (= |ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| |v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_40|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_remove_~map#1.base_BEFORE_CALL_40|) 0) .cse0)))) is different from true [2021-12-18 00:45:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 162 proven. 318 refuted. 0 times theorem prover too weak. 57 trivial. 3 not checked. [2021-12-18 00:45:47,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:45:47,456 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_14977 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_14977) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0))) (forall ((v_ArrVal_14976 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_14976) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|))))) is different from false [2021-12-18 00:45:47,535 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_14983 (Array Int Int)) (v_ArrVal_14976 (Array Int Int))) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| v_ArrVal_14983) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_14976) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|)))) (forall ((|v_s_find_entry_s_find_entry1_~p_entry#1.offset_8| Int) (v_ArrVal_14977 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_hash_table_remove_~#entry~5#1.base|) |v_s_find_entry_s_find_entry1_~p_entry#1.offset_8| |c_ULTIMATE.start_aws_hash_table_remove_~state~8#1.base|)) |c_ULTIMATE.start_aws_hash_table_remove_~was_present#1.base| v_ArrVal_14977) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.base|) |c_ULTIMATE.start_aws_hash_table_remove_~map#1.offset|) 0)))) is different from false [2021-12-18 00:45:47,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:45:47,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318930985] [2021-12-18 00:45:47,537 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:45:47,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392969599] [2021-12-18 00:45:47,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392969599] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:45:47,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:45:47,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2021-12-18 00:45:47,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558489456] [2021-12-18 00:45:47,539 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:45:47,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-18 00:45:47,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:45:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-18 00:45:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2943, Unknown=11, NotChecked=452, Total=3660 [2021-12-18 00:45:47,540 INFO L87 Difference]: Start difference. First operand 441 states and 534 transitions. Second operand has 54 states, 48 states have (on average 3.1458333333333335) internal successors, (151), 50 states have internal predecessors, (151), 25 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (41), 24 states have call predecessors, (41), 24 states have call successors, (41) [2021-12-18 00:46:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:11,155 INFO L93 Difference]: Finished difference Result 544 states and 657 transitions. [2021-12-18 00:46:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-12-18 00:46:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 48 states have (on average 3.1458333333333335) internal successors, (151), 50 states have internal predecessors, (151), 25 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (41), 24 states have call predecessors, (41), 24 states have call successors, (41) Word has length 261 [2021-12-18 00:46:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:11,157 INFO L225 Difference]: With dead ends: 544 [2021-12-18 00:46:11,157 INFO L226 Difference]: Without dead ends: 470 [2021-12-18 00:46:11,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 181 SyntacticMatches, 44 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2417 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=407, Invalid=5272, Unknown=37, NotChecked=604, Total=6320 [2021-12-18 00:46:11,159 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 371 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 8283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6437 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:11,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 2563 Invalid, 8283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1591 Invalid, 0 Unknown, 6437 Unchecked, 1.2s Time] [2021-12-18 00:46:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-12-18 00:46:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 457. [2021-12-18 00:46:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 298 states have (on average 1.1241610738255035) internal successors, (335), 303 states have internal predecessors, (335), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (115), 100 states have call predecessors, (115), 100 states have call successors, (115) [2021-12-18 00:46:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 552 transitions. [2021-12-18 00:46:11,187 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 552 transitions. Word has length 261 [2021-12-18 00:46:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:11,188 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 552 transitions. [2021-12-18 00:46:11,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 48 states have (on average 3.1458333333333335) internal successors, (151), 50 states have internal predecessors, (151), 25 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (41), 24 states have call predecessors, (41), 24 states have call successors, (41) [2021-12-18 00:46:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 552 transitions. [2021-12-18 00:46:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-12-18 00:46:11,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:11,190 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:46:11,229 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-12-18 00:46:11,407 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,SelfDestructingSolverStorable22 [2021-12-18 00:46:11,408 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash 714402390, now seen corresponding path program 1 times [2021-12-18 00:46:11,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:11,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615901527] [2021-12-18 00:46:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:11,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:11,464 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:46:11,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905785193] [2021-12-18 00:46:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:11,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:11,466 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:46:11,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-18 00:46:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:46:12,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 3353 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 00:46:12,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:46:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2021-12-18 00:46:12,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:46:12,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:46:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615901527] [2021-12-18 00:46:12,891 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:46:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905785193] [2021-12-18 00:46:12,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905785193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:46:12,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:46:12,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 00:46:12,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865378898] [2021-12-18 00:46:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:46:12,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 00:46:12,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:46:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 00:46:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 00:46:12,893 INFO L87 Difference]: Start difference. First operand 457 states and 552 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2021-12-18 00:46:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:46:12,938 INFO L93 Difference]: Finished difference Result 683 states and 859 transitions. [2021-12-18 00:46:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 00:46:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 255 [2021-12-18 00:46:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:46:12,941 INFO L225 Difference]: With dead ends: 683 [2021-12-18 00:46:12,941 INFO L226 Difference]: Without dead ends: 482 [2021-12-18 00:46:12,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:46:12,942 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 21 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:46:12,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 1235 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:46:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-12-18 00:46:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 457. [2021-12-18 00:46:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 298 states have (on average 1.1174496644295302) internal successors, (333), 303 states have internal predecessors, (333), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (115), 100 states have call predecessors, (115), 100 states have call successors, (115) [2021-12-18 00:46:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 550 transitions. [2021-12-18 00:46:12,966 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 550 transitions. Word has length 255 [2021-12-18 00:46:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:46:12,966 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 550 transitions. [2021-12-18 00:46:12,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2021-12-18 00:46:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 550 transitions. [2021-12-18 00:46:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-12-18 00:46:12,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:46:12,969 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:46:13,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-18 00:46:13,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:13,196 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:46:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:46:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1489355919, now seen corresponding path program 1 times [2021-12-18 00:46:13,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:46:13,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521721499] [2021-12-18 00:46:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:13,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:46:13,257 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:46:13,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940242510] [2021-12-18 00:46:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:46:13,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:46:13,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:46:13,259 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:46:13,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-18 00:47:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:47:00,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 3406 conjuncts, 608 conjunts are in the unsatisfiable core [2021-12-18 00:47:00,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:47:00,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:47:01,017 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:47:01,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:47:01,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:47:01,311 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-12-18 00:47:01,492 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 17 treesize of output 9 [2021-12-18 00:47:01,780 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-12-18 00:47:02,169 INFO L354 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2021-12-18 00:47:02,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 186 [2021-12-18 00:47:04,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:47:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 199 proven. 18 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2021-12-18 00:47:05,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:47:05,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:47:05,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521721499] [2021-12-18 00:47:05,882 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:47:05,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940242510] [2021-12-18 00:47:05,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940242510] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:47:05,882 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:47:05,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-12-18 00:47:05,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861937315] [2021-12-18 00:47:05,882 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:47:05,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-18 00:47:05,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:47:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-18 00:47:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2021-12-18 00:47:05,884 INFO L87 Difference]: Start difference. First operand 457 states and 550 transitions. Second operand has 31 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 11 states have call successors, (37), 6 states have call predecessors, (37), 10 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2021-12-18 00:47:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:47:06,353 INFO L93 Difference]: Finished difference Result 461 states and 553 transitions. [2021-12-18 00:47:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-18 00:47:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 11 states have call successors, (37), 6 states have call predecessors, (37), 10 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) Word has length 266 [2021-12-18 00:47:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:47:06,356 INFO L225 Difference]: With dead ends: 461 [2021-12-18 00:47:06,356 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 00:47:06,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=145, Invalid=1577, Unknown=0, NotChecked=0, Total=1722 [2021-12-18 00:47:06,358 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:47:06,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 263 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2021-12-18 00:47:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 00:47:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 00:47:06,358 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-12-18 00:47:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 00:47:06,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 266 [2021-12-18 00:47:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:47:06,359 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 00:47:06,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 11 states have call successors, (37), 6 states have call predecessors, (37), 10 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2021-12-18 00:47:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 00:47:06,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 00:47:06,361 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 00:47:06,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-18 00:47:06,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:47:06,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-18 00:47:07,931 INFO L861 garLoopResultBuilder]: At program point L7342(line 7342) the Hoare annotation is: true [2021-12-18 00:47:07,931 INFO L858 garLoopResultBuilder]: For program point uninterpreted_equalsFINAL(lines 7331 7345) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point L7339-1(line 7339) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point L7339(line 7339) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point L7342-3(line 7342) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point L7342-2(line 7342) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point L7342-1(line 7342) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point uninterpreted_equalsEXIT(lines 7331 7345) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point L7335-1(line 7335) no Hoare annotation was computed. [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point L7337-1(line 7337) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point uninterpreted_equalsENTRY(lines 7331 7345) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L861 garLoopResultBuilder]: At program point L7337(line 7337) the Hoare annotation is: true [2021-12-18 00:47:07,932 INFO L858 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L854 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= bounded_malloc_~size |bounded_malloc_#in~size|)) (not (< 0 |#StackHeapBarrier|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_15| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int)) (or (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 4)) (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (= (+ (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_15|) 0) 29629528) (+ (* 442721857769029238784 |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|) (* 24 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|))))))) [2021-12-18 00:47:07,933 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_15| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int)) (or (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 4)) (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (= (+ (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_15|) 0) 29629528) (+ (* 442721857769029238784 |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|) (* 24 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)))))) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L861 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_equalsENTRY(line 239) the Hoare annotation is: true [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsFINAL(line 239) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsEXIT(line 239) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherEXIT(line 238) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L861 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_hasherENTRY(line 238) the Hoare annotation is: true [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherFINAL(line 238) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L858 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2021-12-18 00:47:07,933 INFO L861 garLoopResultBuilder]: At program point L10008-4(line 10008) the Hoare annotation is: true [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L861 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10006 10009) the Hoare annotation is: true [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10006 10009) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10006 10009) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L861 garLoopResultBuilder]: At program point L9635-2(lines 9635 9654) the Hoare annotation is: true [2021-12-18 00:47:07,934 INFO L861 garLoopResultBuilder]: At program point L9160-8(line 9160) the Hoare annotation is: true [2021-12-18 00:47:07,934 INFO L861 garLoopResultBuilder]: At program point L9623(line 9623) the Hoare annotation is: true [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L9623-1(line 9623) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L861 garLoopResultBuilder]: At program point L9157(lines 9157 9161) the Hoare annotation is: true [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L9624-3(line 9624) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L9657(line 9657) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L9624(line 9624) no Hoare annotation was computed. [2021-12-18 00:47:07,934 INFO L858 garLoopResultBuilder]: For program point L9657-1(line 9657) no Hoare annotation was computed. [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point L9657-2(lines 9621 9659) the Hoare annotation is: true [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point L9624-2(line 9624) the Hoare annotation is: true [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point L9158-1(line 9158) the Hoare annotation is: true [2021-12-18 00:47:07,935 INFO L858 garLoopResultBuilder]: For program point L9158-2(line 9158) no Hoare annotation was computed. [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point L9158(line 9158) the Hoare annotation is: true [2021-12-18 00:47:07,935 INFO L858 garLoopResultBuilder]: For program point L9658(line 9658) no Hoare annotation was computed. [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point L9658-5(lines 9621 9659) the Hoare annotation is: true [2021-12-18 00:47:07,935 INFO L858 garLoopResultBuilder]: For program point L9658-6(lines 9621 9659) no Hoare annotation was computed. [2021-12-18 00:47:07,935 INFO L858 garLoopResultBuilder]: For program point L9658-1(line 9658) no Hoare annotation was computed. [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point L9658-3(line 9658) the Hoare annotation is: true [2021-12-18 00:47:07,935 INFO L858 garLoopResultBuilder]: For program point L9658-4(line 9658) no Hoare annotation was computed. [2021-12-18 00:47:07,935 INFO L861 garLoopResultBuilder]: At program point s_remove_entryENTRY(lines 9621 9659) the Hoare annotation is: true [2021-12-18 00:47:07,936 INFO L861 garLoopResultBuilder]: At program point L9622-1(line 9622) the Hoare annotation is: true [2021-12-18 00:47:07,936 INFO L858 garLoopResultBuilder]: For program point L9622-2(line 9622) no Hoare annotation was computed. [2021-12-18 00:47:07,936 INFO L858 garLoopResultBuilder]: For program point s_remove_entryEXIT(lines 9621 9659) no Hoare annotation was computed. [2021-12-18 00:47:07,936 INFO L861 garLoopResultBuilder]: At program point L9622(line 9622) the Hoare annotation is: true [2021-12-18 00:47:07,936 INFO L858 garLoopResultBuilder]: For program point L9647(lines 9647 9649) no Hoare annotation was computed. [2021-12-18 00:47:07,936 INFO L858 garLoopResultBuilder]: For program point L9160-3(line 9160) no Hoare annotation was computed. [2021-12-18 00:47:07,936 INFO L861 garLoopResultBuilder]: At program point L9160-5(line 9160) the Hoare annotation is: true [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point L9160-6(line 9160) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point L9160-1(line 9160) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point L9639(lines 9639 9641) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L861 garLoopResultBuilder]: At program point L9160-2(line 9160) the Hoare annotation is: true [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-18 00:47:07,937 INFO L854 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10119 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10119 10131) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point L10126-1(line 10126) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L858 garLoopResultBuilder]: For program point L10126-2(lines 10126 10128) no Hoare annotation was computed. [2021-12-18 00:47:07,937 INFO L854 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= 0 |hash_table_state_required_bytes_~#elemsize~0.offset|) (= |#memory_real| |old(#memory_real)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (exists ((v_ArrVal_14897 Int)) (= |#valid| (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_14897))))) [2021-12-18 00:47:07,937 INFO L854 garLoopResultBuilder]: At program point L10126(line 10126) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= 0 (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|)) (= |hash_table_state_required_bytes_#t~mem1324| (* 24 |hash_table_state_required_bytes_#in~size|)) (exists ((v_ArrVal_10623 Int) (|v___CPROVER_overflow_mult_~#c~1.base_114| Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_10623))) (and (= 0 (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_114|)) (= |#valid| (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_114| 0))))))) [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10119 10131) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L10122-2(lines 10122 10124) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L861 garLoopResultBuilder]: At program point L9150-1(line 9150) the Hoare annotation is: true [2021-12-18 00:47:07,938 INFO L861 garLoopResultBuilder]: At program point s_hash_keys_eqENTRY(lines 9147 9155) the Hoare annotation is: true [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L9150-2(line 9150) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point s_hash_keys_eqEXIT(lines 9147 9155) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L861 garLoopResultBuilder]: At program point L9153(line 9153) the Hoare annotation is: true [2021-12-18 00:47:07,938 INFO L861 garLoopResultBuilder]: At program point L9154-1(line 9154) the Hoare annotation is: true [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L9153-1(line 9153) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L9154-2(line 9154) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L861 garLoopResultBuilder]: At program point L9154-3(line 9154) the Hoare annotation is: true [2021-12-18 00:47:07,938 INFO L861 garLoopResultBuilder]: At program point L9150(line 9150) the Hoare annotation is: true [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L9154-4(lines 9147 9155) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-12-18 00:47:07,938 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L854 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 00:47:07,939 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= ~tl_last_error~0 |old(~tl_last_error~0)|))) (let ((.cse1 (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and .cse0 (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0))))) (or (not (< 0 |#StackHeapBarrier|)) (and .cse0 .cse1 (exists ((|v___CPROVER_overflow_mult_~#c~1.base_114| Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_114|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_114| 0)))) (= (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|) (* |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_#in~b#1|))) (and .cse1 (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0))))) [2021-12-18 00:47:07,939 INFO L854 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~b#1| |aws_mul_size_checked_#in~b#1|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~a#1| |aws_mul_size_checked_#in~a#1|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L854 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (exists ((v_ArrVal_9462 Int) (|v___CPROVER_overflow_mult_~#c~1.base_106| Int)) (and (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_106| v_ArrVal_9462)) (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_106|)))))) [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L861 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point L9115(line 9115) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L861 garLoopResultBuilder]: At program point L9115-1(lines 9100 9116) the Hoare annotation is: true [2021-12-18 00:47:07,939 INFO L858 garLoopResultBuilder]: For program point L9115-2(lines 9100 9116) no Hoare annotation was computed. [2021-12-18 00:47:07,939 INFO L861 garLoopResultBuilder]: At program point L9101(line 9101) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L861 garLoopResultBuilder]: At program point L9101-1(line 9101) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point L9101-2(line 9101) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L861 garLoopResultBuilder]: At program point L7373-1(lines 7369 7374) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L861 garLoopResultBuilder]: At program point s_hash_forENTRY(lines 9100 9116) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L861 garLoopResultBuilder]: At program point L7370(lines 7370 7372) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point s_hash_forEXIT(lines 9100 9116) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L861 garLoopResultBuilder]: At program point L7370-1(lines 7370 7372) the Hoare annotation is: true [2021-12-18 00:47:07,940 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2021-12-18 00:47:07,940 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,941 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L858 garLoopResultBuilder]: For program point L7356(line 7356) no Hoare annotation was computed. [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7350(lines 7350 7352) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7353(lines 7353 7355) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,941 INFO L858 garLoopResultBuilder]: For program point L7284(lines 7284 7286) no Hoare annotation was computed. [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7350-1(lines 7350 7352) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7281-1(lines 7281 7283) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L7281(lines 7281 7283) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2021-12-18 00:47:07,941 INFO L861 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10017 10064) the Hoare annotation is: true [2021-12-18 00:47:07,942 INFO L861 garLoopResultBuilder]: At program point L10045(line 10045) the Hoare annotation is: true [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point L10045-1(line 10045) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10017 10064) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10017 10064) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L861 garLoopResultBuilder]: At program point L7406(line 7406) the Hoare annotation is: true [2021-12-18 00:47:07,942 INFO L861 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7405 7407) the Hoare annotation is: true [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point L7406-1(line 7406) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7405 7407) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7405 7407) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L861 garLoopResultBuilder]: At program point s_safe_eq_checkENTRY(lines 9121 9142) the Hoare annotation is: true [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L861 garLoopResultBuilder]: At program point L9141(line 9141) the Hoare annotation is: true [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point L9141-1(line 9141) no Hoare annotation was computed. [2021-12-18 00:47:07,942 INFO L858 garLoopResultBuilder]: For program point s_safe_eq_checkFINAL(lines 9121 9142) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point s_safe_eq_checkEXIT(lines 9121 9142) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L861 garLoopResultBuilder]: At program point memset_implENTRY(lines 7399 7403) the Hoare annotation is: true [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L7400-1(line 7400) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L861 garLoopResultBuilder]: At program point L7400(line 7400) the Hoare annotation is: true [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point memset_implFINAL(lines 7399 7403) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point memset_implEXIT(lines 7399 7403) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point s_find_entryFINAL(lines 9321 9346) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point s_find_entryEXIT(lines 9321 9346) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L861 garLoopResultBuilder]: At program point s_find_entryENTRY(lines 9321 9346) the Hoare annotation is: true [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9377-4(lines 9377 9380) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2021-12-18 00:47:07,943 INFO L858 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L861 garLoopResultBuilder]: At program point L9377-1(line 9377) the Hoare annotation is: true [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9377-2(line 9377) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L861 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: true [2021-12-18 00:47:07,944 INFO L861 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: true [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9337-4(lines 9337 9343) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L861 garLoopResultBuilder]: At program point L9337-1(line 9337) the Hoare annotation is: true [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9337-2(line 9337) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (< 0 |#StackHeapBarrier|))) [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-12-18 00:47:07,944 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2021-12-18 00:47:07,945 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|))) [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2021-12-18 00:47:07,945 INFO L861 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2021-12-18 00:47:07,945 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_114| Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_114|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_114| 0))))) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 00:47:07,945 INFO L854 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2021-12-18 00:47:07,945 INFO L854 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|) (= |aws_add_size_checked_aws_add_u64_checked_~r#1.base| |aws_add_size_checked_#in~r#1.base|) (= |#length| |old(#length)|) (= |aws_add_size_checked_aws_add_u64_checked_~b#1| |aws_add_size_checked_#in~b#1|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_aws_add_u64_checked_~r#1.offset| |aws_add_size_checked_#in~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_add_size_checked_aws_add_u64_checked_~a#1| |aws_add_size_checked_#in~a#1|))) [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_114| Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_114|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_114| 0))))) (not (< 0 |#StackHeapBarrier|))) [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L854 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L9697(lines 9697 9706) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L854 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse1 (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|)) (.cse2 (< 0 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|))) (or (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) 29629528) (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse0 .cse1 (= 0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) .cse2 .cse3) (and (< 1 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) .cse0 .cse1 .cse2 .cse3))) [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L10135-2(line 10135) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L858 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2021-12-18 00:47:07,946 INFO L854 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2021-12-18 00:47:07,947 INFO L854 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: false [2021-12-18 00:47:07,947 INFO L854 garLoopResultBuilder]: At program point L10135-1(line 10135) the Hoare annotation is: false [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L854 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1| .cse0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (+ .cse0 29629528) (* 24 |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1|)))) [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point L9690(lines 9690 9693) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L854 garLoopResultBuilder]: At program point L10144(line 10144) the Hoare annotation is: false [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point L10144-1(line 10144) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point L10136-3(lines 10136 10138) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2021-12-18 00:47:07,947 INFO L854 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2021-12-18 00:47:07,947 INFO L858 garLoopResultBuilder]: For program point L9682(lines 9682 9684) no Hoare annotation was computed. [2021-12-18 00:47:07,948 INFO L858 garLoopResultBuilder]: For program point L9690-1(lines 9690 9693) no Hoare annotation was computed. [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L10136(line 10136) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L858 garLoopResultBuilder]: For program point L10136-1(lines 10136 10138) no Hoare annotation was computed. [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L9707(line 9707) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L858 garLoopResultBuilder]: For program point L9707-1(line 9707) no Hoare annotation was computed. [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L10161-1(line 10161) the Hoare annotation is: (and (< 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#was_present~0#1.base|) (< 1 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_#t~ret1350#1| 0) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L9682-2(lines 9682 9684) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L858 garLoopResultBuilder]: For program point L10161-2(line 10161) no Hoare annotation was computed. [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L9666(line 9666) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L10170(line 10170) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L854 garLoopResultBuilder]: At program point L9666-1(line 9666) the Hoare annotation is: false [2021-12-18 00:47:07,948 INFO L858 garLoopResultBuilder]: For program point L9666-2(line 9666) no Hoare annotation was computed. [2021-12-18 00:47:07,948 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L10162(line 10162) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L10170-1(line 10170) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L10170-2(line 10170) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L861 garLoopResultBuilder]: At program point L10187(line 10187) the Hoare annotation is: true [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L10162-1(line 10162) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L9700(lines 9700 9702) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L9667(lines 9667 9669) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L9667-1(lines 9667 9669) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L9700-2(lines 9700 9702) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L9692-1(line 9692) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L10171(lines 10171 10185) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L9692-2(line 9692) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L10171-1(lines 10171 10185) no Hoare annotation was computed. [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-12-18 00:47:07,949 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-12-18 00:47:07,949 INFO L858 garLoopResultBuilder]: For program point L10163(lines 10132 10186) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L854 garLoopResultBuilder]: At program point L9692-4(line 9692) the Hoare annotation is: false [2021-12-18 00:47:07,950 INFO L854 garLoopResultBuilder]: At program point L9709-1(line 9709) the Hoare annotation is: false [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L9709-2(line 9709) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L854 garLoopResultBuilder]: At program point L9701(line 9701) the Hoare annotation is: false [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L9701-1(line 9701) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L10180(line 10180) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L854 garLoopResultBuilder]: At program point L10147(line 10147) the Hoare annotation is: false [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L10147-1(line 10147) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L10180-2(lines 10180 10182) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L854 garLoopResultBuilder]: At program point L9709-4(line 9709) the Hoare annotation is: false [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L9709-5(line 9709) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L10172(lines 10172 10178) no Hoare annotation was computed. [2021-12-18 00:47:07,950 INFO L854 garLoopResultBuilder]: At program point L10139(line 10139) the Hoare annotation is: false [2021-12-18 00:47:07,950 INFO L858 garLoopResultBuilder]: For program point L10139-1(lines 10139 10141) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L10172-2(lines 10172 10178) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L10139-3(lines 10139 10141) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L10181(line 10181) the Hoare annotation is: false [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L10181-1(line 10181) the Hoare annotation is: false [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L10181-2(line 10181) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L9661(lines 9661 9710) the Hoare annotation is: false [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L10173(line 10173) the Hoare annotation is: false [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L10173-1(line 10173) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2021-12-18 00:47:07,951 INFO L854 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.offset|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0#1.base|)) [2021-12-18 00:47:07,951 INFO L858 garLoopResultBuilder]: For program point L10165-1(lines 10165 10169) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L10132(lines 10132 10186) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L9686(lines 9686 9688) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L9678-1(line 9678) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L854 garLoopResultBuilder]: At program point L9678(line 9678) the Hoare annotation is: false [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L9703-2(lines 9697 9706) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L9703(lines 9703 9705) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L854 garLoopResultBuilder]: At program point L9704(line 9704) the Hoare annotation is: false [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L9671(lines 9671 9673) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L9704-1(line 9704) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L854 garLoopResultBuilder]: At program point L10175-2(line 10175) the Hoare annotation is: false [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L10175-3(line 10175) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L10175(line 10175) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2021-12-18 00:47:07,952 INFO L854 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2021-12-18 00:47:07,952 INFO L858 garLoopResultBuilder]: For program point L10167-1(lines 10167 10168) no Hoare annotation was computed. [2021-12-18 00:47:07,953 INFO L854 garLoopResultBuilder]: At program point L10184(line 10184) the Hoare annotation is: false [2021-12-18 00:47:07,953 INFO L858 garLoopResultBuilder]: For program point L10184-1(line 10184) no Hoare annotation was computed. [2021-12-18 00:47:07,953 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-18 00:47:07,953 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-18 00:47:07,953 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-18 00:47:07,953 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-18 00:47:07,953 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-18 00:47:07,953 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-18 00:47:07,956 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:47:07,957 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 00:47:07,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,967 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,970 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,971 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,974 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,974 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:07,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:07,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:07,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:47:07 BoogieIcfgContainer [2021-12-18 00:47:07,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 00:47:07,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 00:47:07,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 00:47:07,983 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 00:47:07,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:41:50" (3/4) ... [2021-12-18 00:47:07,986 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 00:47:07,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure uninterpreted_equals [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_equals [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_hasher [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_remove_entry [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_keys_eq [2021-12-18 00:47:07,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_for [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_safe_eq_check [2021-12-18 00:47:08,000 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_impl [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_find_entry [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2021-12-18 00:47:08,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2021-12-18 00:47:08,002 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-18 00:47:08,027 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 209 nodes and edges [2021-12-18 00:47:08,029 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2021-12-18 00:47:08,030 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2021-12-18 00:47:08,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-12-18 00:47:08,033 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-18 00:47:08,034 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-18 00:47:08,035 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-18 00:47:08,037 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 00:47:08,067 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || (((tl_last_error == \old(tl_last_error) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || (tl_last_error == \old(tl_last_error) && \result == 0))) && (\exists v___CPROVER_overflow_mult_~#c~1.base_114 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114 := 0])) && unknown-#memory_int-unknown[r][r] == \old(a) * \old(b))) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || (tl_last_error == \old(tl_last_error) && \result == 0)) && \result + 1 <= 0) [2021-12-18 00:47:08,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || ((tl_last_error == \old(tl_last_error) && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && (\exists v___CPROVER_overflow_mult_~#c~1.base_114 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114 := 0]))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) [2021-12-18 00:47:08,727 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 00:47:08,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 00:47:08,728 INFO L158 Benchmark]: Toolchain (without parser) took 322005.40ms. Allocated memory was 92.3MB in the beginning and 872.4MB in the end (delta: 780.1MB). Free memory was 51.9MB in the beginning and 567.2MB in the end (delta: -515.3MB). Peak memory consumption was 604.3MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,728 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:47:08,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2330.63ms. Allocated memory was 92.3MB in the beginning and 163.6MB in the end (delta: 71.3MB). Free memory was 51.6MB in the beginning and 100.1MB in the end (delta: -48.5MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.78ms. Allocated memory is still 163.6MB. Free memory was 100.1MB in the beginning and 86.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,729 INFO L158 Benchmark]: Boogie Preprocessor took 73.50ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 77.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,729 INFO L158 Benchmark]: RCFGBuilder took 1272.64ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 77.0MB in the beginning and 117.1MB in the end (delta: -40.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,729 INFO L158 Benchmark]: TraceAbstraction took 317422.34ms. Allocated memory was 220.2MB in the beginning and 872.4MB in the end (delta: 652.2MB). Free memory was 117.1MB in the beginning and 323.8MB in the end (delta: -206.7MB). Peak memory consumption was 446.5MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,729 INFO L158 Benchmark]: Witness Printer took 744.89ms. Allocated memory is still 872.4MB. Free memory was 323.8MB in the beginning and 567.2MB in the end (delta: -243.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2021-12-18 00:47:08,730 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2330.63ms. Allocated memory was 92.3MB in the beginning and 163.6MB in the end (delta: 71.3MB). Free memory was 51.6MB in the beginning and 100.1MB in the end (delta: -48.5MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.78ms. Allocated memory is still 163.6MB. Free memory was 100.1MB in the beginning and 86.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.50ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 77.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1272.64ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 77.0MB in the beginning and 117.1MB in the end (delta: -40.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 317422.34ms. Allocated memory was 220.2MB in the beginning and 872.4MB in the end (delta: 652.2MB). Free memory was 117.1MB in the beginning and 323.8MB in the end (delta: -206.7MB). Peak memory consumption was 446.5MB. Max. memory is 16.1GB. * Witness Printer took 744.89ms. Allocated memory is still 872.4MB. Free memory was 323.8MB in the beginning and 567.2MB in the end (delta: -243.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 315 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 317.3s, OverallIterations: 25, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 66.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4919 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4728 mSDsluCounter, 44935 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 25582 IncrementalHoareTripleChecker+Unchecked, 35798 mSDsCounter, 2650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15664 IncrementalHoareTripleChecker+Invalid, 43896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2650 mSolverCounterUnsat, 9137 mSDtfsCounter, 15664 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7775 GetRequests, 6928 SyntacticMatches, 195 SemanticMatches, 652 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 9233 ImplicationChecksByTransitivity, 147.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=17, InterpolantAutomatonStates: 394, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 320 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 130 LocationsWithAnnotation, 2677 PreInvPairs, 2777 NumberOfFragments, 948 HoareAnnotationTreeSize, 2677 FomulaSimplifications, 165 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 130 FomulaSimplificationsInter, 2968 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 61.6s SatisfiabilityAnalysisTime, 168.8s InterpolantComputationTime, 8324 NumberOfCodeBlocks, 8293 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 9255 ConstructedInterpolants, 858 QuantifiedInterpolants, 51059 SizeOfPredicates, 376 NumberOfNonLiveVariables, 73132 ConjunctsInSsa, 2090 ConjunctsInUnsatCore, 41 InterpolantComputations, 18 PerfectInterpolantSequences, 18614/20324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9709]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9157]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9692]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2021-12-18 00:47:08,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,749 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,751 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,758 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || (((tl_last_error == \old(tl_last_error) && ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || (tl_last_error == \old(tl_last_error) && \result == 0))) && (\exists v___CPROVER_overflow_mult_~#c~1.base_114 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114 := 0])) && unknown-#memory_int-unknown[r][r] == \old(a) * \old(b))) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || (tl_last_error == \old(tl_last_error) && \result == 0)) && \result + 1 <= 0) - InvariantResult [Line: 2541]: Loop Invariant [2021-12-18 00:47:08,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_114,QUANTIFIED] [2021-12-18 00:47:08,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:47:08,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:47:08,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || ((tl_last_error == \old(tl_last_error) && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && (\exists v___CPROVER_overflow_mult_~#c~1.base_114 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_114 := 0]))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) - InvariantResult [Line: 9661]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9160]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9635]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-18 00:47:08,966 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-12-18 00:47:08,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE