./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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_priority_queue_pop_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 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 13:34:05,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 13:34:05,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 13:34:05,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 13:34:05,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 13:34:05,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 13:34:05,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 13:34:05,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 13:34:05,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 13:34:05,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 13:34:05,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 13:34:05,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 13:34:05,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 13:34:05,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 13:34:05,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 13:34:05,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 13:34:05,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 13:34:05,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 13:34:05,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 13:34:05,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 13:34:05,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 13:34:05,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 13:34:05,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 13:34:05,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 13:34:05,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 13:34:05,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 13:34:05,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 13:34:05,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 13:34:05,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 13:34:05,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 13:34:05,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 13:34:05,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 13:34:05,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 13:34:05,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 13:34:05,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 13:34:05,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 13:34:05,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 13:34:05,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 13:34:05,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 13:34:05,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 13:34:05,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 13:34:05,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 13:34:05,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 13:34:05,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 13:34:05,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 13:34:05,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 13:34:05,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 13:34:05,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 13:34:05,770 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 13:34:05,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 13:34:05,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 13:34:05,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 13:34:05,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 13:34:05,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 13:34:05,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:34:05,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 13:34:05,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 13:34:05,772 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 -> 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac [2021-11-05 13:34:06,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 13:34:06,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 13:34:06,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 13:34:06,120 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 13:34:06,120 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 13:34:06,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i [2021-11-05 13:34:06,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9f8c4be/8289ccdc3f204bcb979b089fe92c1b0f/FLAGaead613ad [2021-11-05 13:34:06,866 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 13:34:06,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i [2021-11-05 13:34:06,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9f8c4be/8289ccdc3f204bcb979b089fe92c1b0f/FLAGaead613ad [2021-11-05 13:34:06,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9f8c4be/8289ccdc3f204bcb979b089fe92c1b0f [2021-11-05 13:34:06,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 13:34:06,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 13:34:07,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 13:34:07,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 13:34:07,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 13:34:07,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:34:06" (1/1) ... [2021-11-05 13:34:07,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88500ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:07, skipping insertion in model container [2021-11-05 13:34:07,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:34:06" (1/1) ... [2021-11-05 13:34:07,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 13:34:07,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 13:34:07,369 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4496,4509] [2021-11-05 13:34:07,380 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4556,4569] [2021-11-05 13:34:07,399 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:34:07,404 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:34:08,067 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,074 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,076 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,078 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,079 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,092 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,095 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,097 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,098 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,099 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,100 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,101 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,101 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,342 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:34:08,343 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:34:08,344 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:34:08,345 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:34:08,346 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:34:08,346 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:34:08,347 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:34:08,347 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:34:08,348 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:34:08,348 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:34:08,443 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:34:08,475 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,480 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,534 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,535 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,536 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,536 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,536 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,537 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,537 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,538 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,538 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,538 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,539 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,539 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,540 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,542 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,543 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,543 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,544 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,546 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,547 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,553 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,554 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,554 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:34:08,610 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 13:34:08,632 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4496,4509] [2021-11-05 13:34:08,633 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4556,4569] [2021-11-05 13:34:08,634 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:34:08,635 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:34:08,683 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,687 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,688 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,688 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,689 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,696 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,702 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,703 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,704 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,705 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,705 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,705 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,706 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,746 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:34:08,754 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:34:08,755 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:34:08,758 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:34:08,759 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:34:08,759 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:34:08,760 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:34:08,760 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:34:08,761 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:34:08,761 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:34:08,800 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:34:08,824 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,846 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,870 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,875 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,877 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,877 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,877 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,878 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,878 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,880 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,881 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,882 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,882 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,883 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,886 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,891 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,892 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,892 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:34:08,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:34:09,180 INFO L208 MainTranslator]: Completed translation [2021-11-05 13:34:09,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09 WrapperNode [2021-11-05 13:34:09,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 13:34:09,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 13:34:09,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 13:34:09,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 13:34:09,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:09,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:09,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 13:34:09,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 13:34:09,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 13:34:09,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 13:34:09,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:09,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:09,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:09,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:10,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:10,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:10,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:10,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 13:34:10,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 13:34:10,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 13:34:10,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 13:34:10,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (1/1) ... [2021-11-05 13:34:10,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:34:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:34:10,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 13:34:10,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 13:34:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 13:34:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-05 13:34:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 13:34:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 13:34:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 13:34:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 13:34:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 13:34:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 13:34:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 13:34:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-05 13:34:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 13:34:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 13:34:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 13:34:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 13:34:33,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 13:34:33,298 INFO L299 CfgBuilder]: Removed 2646 assume(true) statements. [2021-11-05 13:34:33,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:34:33 BoogieIcfgContainer [2021-11-05 13:34:33,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 13:34:33,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 13:34:33,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 13:34:33,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 13:34:33,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 01:34:06" (1/3) ... [2021-11-05 13:34:33,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f603099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:34:33, skipping insertion in model container [2021-11-05 13:34:33,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:34:09" (2/3) ... [2021-11-05 13:34:33,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f603099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:34:33, skipping insertion in model container [2021-11-05 13:34:33,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:34:33" (3/3) ... [2021-11-05 13:34:33,315 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_pop_harness.i [2021-11-05 13:34:33,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 13:34:33,320 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2021-11-05 13:34:33,384 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 13:34:33,394 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-05 13:34:33,394 INFO L340 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2021-11-05 13:34:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 3341 states, 3253 states have (on average 1.4223793421457116) internal successors, (4627), 3340 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 13:34:33,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:34:33,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:34:33,478 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:34:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:34:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 462763660, now seen corresponding path program 1 times [2021-11-05 13:34:33,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:34:33,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543971699] [2021-11-05 13:34:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:33,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:34:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:34:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:34:34,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:34:34,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543971699] [2021-11-05 13:34:34,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543971699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:34:34,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:34:34,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 13:34:34,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940907948] [2021-11-05 13:34:34,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:34:34,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 13:34:34,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:34:34,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 13:34:34,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:34:34,224 INFO L87 Difference]: Start difference. First operand has 3341 states, 3253 states have (on average 1.4223793421457116) internal successors, (4627), 3340 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:34:34,375 INFO L93 Difference]: Finished difference Result 6676 states and 9247 transitions. [2021-11-05 13:34:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 13:34:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 13:34:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:34:34,408 INFO L225 Difference]: With dead ends: 6676 [2021-11-05 13:34:34,408 INFO L226 Difference]: Without dead ends: 3336 [2021-11-05 13:34:34,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:34:34,424 INFO L933 BasicCegarLoop]: 4318 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 13:34:34,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 13.77ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 13:34:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-11-05 13:34:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3336. [2021-11-05 13:34:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.327485380116959) internal successors, (4313), 3335 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4313 transitions. [2021-11-05 13:34:34,583 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4313 transitions. Word has length 55 [2021-11-05 13:34:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:34:34,584 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4313 transitions. [2021-11-05 13:34:34,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4313 transitions. [2021-11-05 13:34:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 13:34:34,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:34:34,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:34:34,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 13:34:34,595 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:34:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:34:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -349284918, now seen corresponding path program 1 times [2021-11-05 13:34:34,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:34:34,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721661547] [2021-11-05 13:34:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:34,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:34:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:34:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:34:35,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:34:35,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721661547] [2021-11-05 13:34:35,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721661547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:34:35,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:34:35,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:34:35,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582212524] [2021-11-05 13:34:35,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:34:35,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:34:35,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:34:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:34:35,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:34:35,122 INFO L87 Difference]: Start difference. First operand 3336 states and 4313 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:34:36,260 INFO L93 Difference]: Finished difference Result 6604 states and 8535 transitions. [2021-11-05 13:34:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:34:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 13:34:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:34:36,273 INFO L225 Difference]: With dead ends: 6604 [2021-11-05 13:34:36,274 INFO L226 Difference]: Without dead ends: 3348 [2021-11-05 13:34:36,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.61ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:34:36,282 INFO L933 BasicCegarLoop]: 4290 mSDtfsCounter, 4613 mSDsluCounter, 3943 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 915.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4613 SdHoareTripleChecker+Valid, 8233 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 30.19ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 968.48ms IncrementalHoareTripleChecker+Time [2021-11-05 13:34:36,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4613 Valid, 8233 Invalid, 95 Unknown, 0 Unchecked, 30.19ms Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 968.48ms Time] [2021-11-05 13:34:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2021-11-05 13:34:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3336. [2021-11-05 13:34:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3265620190827947) internal successors, (4310), 3335 states have internal predecessors, (4310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4310 transitions. [2021-11-05 13:34:36,368 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4310 transitions. Word has length 55 [2021-11-05 13:34:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:34:36,369 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4310 transitions. [2021-11-05 13:34:36,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4310 transitions. [2021-11-05 13:34:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-05 13:34:36,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:34:36,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:34:36,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 13:34:36,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:34:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:34:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash -44069140, now seen corresponding path program 1 times [2021-11-05 13:34:36,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:34:36,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572893382] [2021-11-05 13:34:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:36,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:34:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:34:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:34:36,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:34:36,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572893382] [2021-11-05 13:34:36,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572893382] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:34:36,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:34:36,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:34:36,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600665272] [2021-11-05 13:34:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:34:36,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:34:36,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:34:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:34:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:34:36,754 INFO L87 Difference]: Start difference. First operand 3336 states and 4310 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:34:42,563 INFO L93 Difference]: Finished difference Result 9015 states and 11551 transitions. [2021-11-05 13:34:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:34:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-05 13:34:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:34:42,591 INFO L225 Difference]: With dead ends: 9015 [2021-11-05 13:34:42,592 INFO L226 Difference]: Without dead ends: 5727 [2021-11-05 13:34:42,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.18ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:34:42,602 INFO L933 BasicCegarLoop]: 4269 mSDtfsCounter, 10540 mSDsluCounter, 7096 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4928.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10540 SdHoareTripleChecker+Valid, 11365 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.99ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5402.74ms IncrementalHoareTripleChecker+Time [2021-11-05 13:34:42,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10540 Valid, 11365 Invalid, 1211 Unknown, 0 Unchecked, 44.99ms Time], IncrementalHoareTripleChecker [27 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 5402.74ms Time] [2021-11-05 13:34:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2021-11-05 13:34:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 3336. [2021-11-05 13:34:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3256386580486303) internal successors, (4307), 3335 states have internal predecessors, (4307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4307 transitions. [2021-11-05 13:34:42,728 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4307 transitions. Word has length 63 [2021-11-05 13:34:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:34:42,728 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4307 transitions. [2021-11-05 13:34:42,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4307 transitions. [2021-11-05 13:34:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 13:34:42,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:34:42,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:34:42,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 13:34:42,730 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:34:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:34:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 170313652, now seen corresponding path program 1 times [2021-11-05 13:34:42,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:34:42,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459985426] [2021-11-05 13:34:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:42,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:34:42,851 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:34:42,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294428958] [2021-11-05 13:34:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:42,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:34:42,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:34:42,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:34:42,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-05 13:34:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:34:43,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 13:34:43,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:34:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:34:44,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:34:44,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:34:44,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459985426] [2021-11-05 13:34:44,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:34:44,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294428958] [2021-11-05 13:34:44,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294428958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:34:44,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:34:44,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:34:44,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985656162] [2021-11-05 13:34:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:34:44,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:34:44,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:34:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:34:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:34:44,341 INFO L87 Difference]: Start difference. First operand 3336 states and 4307 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:34:47,180 INFO L93 Difference]: Finished difference Result 9185 states and 11791 transitions. [2021-11-05 13:34:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 13:34:47,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-05 13:34:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:34:47,201 INFO L225 Difference]: With dead ends: 9185 [2021-11-05 13:34:47,201 INFO L226 Difference]: Without dead ends: 5928 [2021-11-05 13:34:47,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 158.39ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:34:47,210 INFO L933 BasicCegarLoop]: 4116 mSDtfsCounter, 18984 mSDsluCounter, 7545 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2222.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18984 SdHoareTripleChecker+Valid, 11661 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 38.53ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2458.79ms IncrementalHoareTripleChecker+Time [2021-11-05 13:34:47,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18984 Valid, 11661 Invalid, 702 Unknown, 0 Unchecked, 38.53ms Time], IncrementalHoareTripleChecker [21 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 2458.79ms Time] [2021-11-05 13:34:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2021-11-05 13:34:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 3336. [2021-11-05 13:34:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.324715297014466) internal successors, (4304), 3335 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4304 transitions. [2021-11-05 13:34:47,329 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4304 transitions. Word has length 79 [2021-11-05 13:34:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:34:47,329 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4304 transitions. [2021-11-05 13:34:47,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4304 transitions. [2021-11-05 13:34:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-05 13:34:47,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:34:47,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:34:47,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-05 13:34:47,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:34:47,544 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:34:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:34:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -561881262, now seen corresponding path program 1 times [2021-11-05 13:34:47,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:34:47,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709230909] [2021-11-05 13:34:47,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:47,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:34:47,633 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:34:47,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696786085] [2021-11-05 13:34:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:47,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:34:47,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:34:47,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:34:47,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-05 13:34:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:34:48,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 13:34:48,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:34:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:34:48,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:34:48,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:34:48,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709230909] [2021-11-05 13:34:48,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:34:48,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696786085] [2021-11-05 13:34:48,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696786085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:34:48,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:34:48,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:34:48,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125379637] [2021-11-05 13:34:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:34:48,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 13:34:48,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:34:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 13:34:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:34:48,957 INFO L87 Difference]: Start difference. First operand 3336 states and 4304 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:34:54,123 INFO L93 Difference]: Finished difference Result 9201 states and 11809 transitions. [2021-11-05 13:34:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 13:34:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-05 13:34:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:34:54,140 INFO L225 Difference]: With dead ends: 9201 [2021-11-05 13:34:54,140 INFO L226 Difference]: Without dead ends: 5928 [2021-11-05 13:34:54,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 213.61ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-05 13:34:54,149 INFO L933 BasicCegarLoop]: 4083 mSDtfsCounter, 19203 mSDsluCounter, 10576 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4243.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19203 SdHoareTripleChecker+Valid, 14659 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.96ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4701.86ms IncrementalHoareTripleChecker+Time [2021-11-05 13:34:54,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19203 Valid, 14659 Invalid, 1789 Unknown, 0 Unchecked, 34.96ms Time], IncrementalHoareTripleChecker [46 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 4701.86ms Time] [2021-11-05 13:34:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2021-11-05 13:34:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 3336. [2021-11-05 13:34:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3237919359803016) internal successors, (4301), 3335 states have internal predecessors, (4301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4301 transitions. [2021-11-05 13:34:54,287 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4301 transitions. Word has length 103 [2021-11-05 13:34:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:34:54,287 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4301 transitions. [2021-11-05 13:34:54,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:34:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4301 transitions. [2021-11-05 13:34:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-05 13:34:54,289 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:34:54,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:34:54,326 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-11-05 13:34:54,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:34:54,504 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:34:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:34:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1200811894, now seen corresponding path program 1 times [2021-11-05 13:34:54,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:34:54,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184742030] [2021-11-05 13:34:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:54,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:34:54,609 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:34:54,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731052100] [2021-11-05 13:34:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:34:54,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:34:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:34:54,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:34:54,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-05 13:34:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:34:55,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 2995 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:34:55,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:34:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:34:56,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:34:56,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:34:56,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184742030] [2021-11-05 13:34:56,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:34:56,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731052100] [2021-11-05 13:34:56,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731052100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:34:56,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:34:56,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:34:56,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796265761] [2021-11-05 13:34:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:34:56,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:34:56,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:34:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:34:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:34:56,072 INFO L87 Difference]: Start difference. First operand 3336 states and 4301 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:01,923 INFO L93 Difference]: Finished difference Result 6558 states and 8455 transitions. [2021-11-05 13:35:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:35:01,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-11-05 13:35:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:01,933 INFO L225 Difference]: With dead ends: 6558 [2021-11-05 13:35:01,933 INFO L226 Difference]: Without dead ends: 3405 [2021-11-05 13:35:01,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.75ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:35:01,937 INFO L933 BasicCegarLoop]: 4266 mSDtfsCounter, 8827 mSDsluCounter, 7381 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5157.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8827 SdHoareTripleChecker+Valid, 11647 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.02ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5577.95ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:01,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8827 Valid, 11647 Invalid, 1191 Unknown, 0 Unchecked, 26.02ms Time], IncrementalHoareTripleChecker [5 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 5577.95ms Time] [2021-11-05 13:35:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2021-11-05 13:35:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3336. [2021-11-05 13:35:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3231763619575254) internal successors, (4299), 3335 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4299 transitions. [2021-11-05 13:35:02,035 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4299 transitions. Word has length 119 [2021-11-05 13:35:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:02,036 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4299 transitions. [2021-11-05 13:35:02,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4299 transitions. [2021-11-05 13:35:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-05 13:35:02,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:02,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:02,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-05 13:35:02,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:02,256 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1513903148, now seen corresponding path program 1 times [2021-11-05 13:35:02,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:02,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73984338] [2021-11-05 13:35:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:02,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:02,340 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:02,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214508300] [2021-11-05 13:35:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:02,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:02,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 13:35:02,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-05 13:35:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:03,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 13:35:03,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:03,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:03,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:03,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73984338] [2021-11-05 13:35:03,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:03,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214508300] [2021-11-05 13:35:03,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214508300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:03,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:03,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:35:03,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911099676] [2021-11-05 13:35:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:03,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:35:03,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:35:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:35:03,406 INFO L87 Difference]: Start difference. First operand 3336 states and 4299 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:08,352 INFO L93 Difference]: Finished difference Result 7285 states and 9465 transitions. [2021-11-05 13:35:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:35:08,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-11-05 13:35:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:08,363 INFO L225 Difference]: With dead ends: 7285 [2021-11-05 13:35:08,363 INFO L226 Difference]: Without dead ends: 3996 [2021-11-05 13:35:08,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:35:08,369 INFO L933 BasicCegarLoop]: 4737 mSDtfsCounter, 978 mSDsluCounter, 6750 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4208.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 11487 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.02ms SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4717.61ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:08,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 11487 Invalid, 2487 Unknown, 0 Unchecked, 24.02ms Time], IncrementalHoareTripleChecker [525 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 4717.61ms Time] [2021-11-05 13:35:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2021-11-05 13:35:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 3600. [2021-11-05 13:35:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 3513 states have (on average 1.2988898377455167) internal successors, (4563), 3599 states have internal predecessors, (4563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4563 transitions. [2021-11-05 13:35:08,482 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4563 transitions. Word has length 135 [2021-11-05 13:35:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:08,483 INFO L470 AbstractCegarLoop]: Abstraction has 3600 states and 4563 transitions. [2021-11-05 13:35:08,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4563 transitions. [2021-11-05 13:35:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-05 13:35:08,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:08,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:08,520 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-11-05 13:35:08,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:08,699 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 175040594, now seen corresponding path program 1 times [2021-11-05 13:35:08,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:08,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511824876] [2021-11-05 13:35:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:08,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:08,782 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:08,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258473109] [2021-11-05 13:35:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:08,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:08,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:08,784 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-11-05 13:35:08,786 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-11-05 13:35:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:09,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-05 13:35:09,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:10,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:10,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:10,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511824876] [2021-11-05 13:35:10,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:10,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258473109] [2021-11-05 13:35:10,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258473109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:10,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:10,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:35:10,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915263122] [2021-11-05 13:35:10,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:10,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:35:10,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:10,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:35:10,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:35:10,116 INFO L87 Difference]: Start difference. First operand 3600 states and 4563 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:13,563 INFO L93 Difference]: Finished difference Result 17589 states and 22302 transitions. [2021-11-05 13:35:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 13:35:13,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-11-05 13:35:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:13,596 INFO L225 Difference]: With dead ends: 17589 [2021-11-05 13:35:13,596 INFO L226 Difference]: Without dead ends: 14102 [2021-11-05 13:35:13,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 232.23ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-05 13:35:13,610 INFO L933 BasicCegarLoop]: 4290 mSDtfsCounter, 16694 mSDsluCounter, 25474 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2941.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16694 SdHoareTripleChecker+Valid, 29764 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.59ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3006.06ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:13,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16694 Valid, 29764 Invalid, 85 Unknown, 0 Unchecked, 21.59ms Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 3006.06ms Time] [2021-11-05 13:35:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14102 states. [2021-11-05 13:35:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14102 to 3621. [2021-11-05 13:35:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3534 states have (on average 1.2985285795132995) internal successors, (4589), 3620 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4589 transitions. [2021-11-05 13:35:13,824 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4589 transitions. Word has length 135 [2021-11-05 13:35:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:13,824 INFO L470 AbstractCegarLoop]: Abstraction has 3621 states and 4589 transitions. [2021-11-05 13:35:13,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4589 transitions. [2021-11-05 13:35:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-05 13:35:13,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:13,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:13,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-05 13:35:14,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:14,056 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1736001964, now seen corresponding path program 1 times [2021-11-05 13:35:14,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:14,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244387350] [2021-11-05 13:35:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:14,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:14,144 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:14,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089784986] [2021-11-05 13:35:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:14,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:14,146 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-11-05 13:35:14,147 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-11-05 13:35:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:14,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-05 13:35:14,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:15,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:15,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:15,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244387350] [2021-11-05 13:35:15,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:15,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089784986] [2021-11-05 13:35:15,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089784986] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:15,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:15,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:35:15,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953408708] [2021-11-05 13:35:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:15,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:35:15,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:15,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:35:15,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:35:15,741 INFO L87 Difference]: Start difference. First operand 3621 states and 4589 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:16,447 INFO L93 Difference]: Finished difference Result 10541 states and 13363 transitions. [2021-11-05 13:35:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 13:35:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-11-05 13:35:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:16,463 INFO L225 Difference]: With dead ends: 10541 [2021-11-05 13:35:16,463 INFO L226 Difference]: Without dead ends: 7111 [2021-11-05 13:35:16,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 214.26ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:35:16,472 INFO L933 BasicCegarLoop]: 4291 mSDtfsCounter, 8291 mSDsluCounter, 17164 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 401.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8291 SdHoareTripleChecker+Valid, 21455 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.80ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 413.19ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:16,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8291 Valid, 21455 Invalid, 42 Unknown, 0 Unchecked, 14.80ms Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 413.19ms Time] [2021-11-05 13:35:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7111 states. [2021-11-05 13:35:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7111 to 3678. [2021-11-05 13:35:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3591 states have (on average 1.2979671400724033) internal successors, (4661), 3677 states have internal predecessors, (4661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4661 transitions. [2021-11-05 13:35:16,628 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4661 transitions. Word has length 135 [2021-11-05 13:35:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:16,628 INFO L470 AbstractCegarLoop]: Abstraction has 3678 states and 4661 transitions. [2021-11-05 13:35:16,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4661 transitions. [2021-11-05 13:35:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-05 13:35:16,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:16,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:16,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-05 13:35:16,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:16,843 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1808388522, now seen corresponding path program 1 times [2021-11-05 13:35:16,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:16,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839844157] [2021-11-05 13:35:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:16,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:16,930 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:16,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739123564] [2021-11-05 13:35:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:16,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:16,932 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-11-05 13:35:16,934 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-11-05 13:35:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:17,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-05 13:35:17,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:18,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:18,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:18,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839844157] [2021-11-05 13:35:18,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:18,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739123564] [2021-11-05 13:35:18,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739123564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:18,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:18,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:35:18,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599223450] [2021-11-05 13:35:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:18,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:35:18,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:35:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:35:18,142 INFO L87 Difference]: Start difference. First operand 3678 states and 4661 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:19,829 INFO L93 Difference]: Finished difference Result 7108 states and 9010 transitions. [2021-11-05 13:35:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:35:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-11-05 13:35:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:19,841 INFO L225 Difference]: With dead ends: 7108 [2021-11-05 13:35:19,841 INFO L226 Difference]: Without dead ends: 3600 [2021-11-05 13:35:19,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.66ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:35:19,847 INFO L933 BasicCegarLoop]: 4298 mSDtfsCounter, 1 mSDsluCounter, 8232 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1403.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12530 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.36ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1519.02ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:19,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 12530 Invalid, 366 Unknown, 0 Unchecked, 8.36ms Time], IncrementalHoareTripleChecker [0 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1519.02ms Time] [2021-11-05 13:35:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2021-11-05 13:35:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3600. [2021-11-05 13:35:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 3513 states have (on average 1.2983205237688584) internal successors, (4561), 3599 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4561 transitions. [2021-11-05 13:35:19,979 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4561 transitions. Word has length 135 [2021-11-05 13:35:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:19,979 INFO L470 AbstractCegarLoop]: Abstraction has 3600 states and 4561 transitions. [2021-11-05 13:35:19,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4561 transitions. [2021-11-05 13:35:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-05 13:35:19,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:19,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:20,018 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-11-05 13:35:20,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:20,204 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash 192259578, now seen corresponding path program 1 times [2021-11-05 13:35:20,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:20,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83404971] [2021-11-05 13:35:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:20,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:20,285 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:20,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080646048] [2021-11-05 13:35:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:20,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:20,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:20,287 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-11-05 13:35:20,289 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-11-05 13:35:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:21,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 3207 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-05 13:35:21,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:21,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:21,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:21,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83404971] [2021-11-05 13:35:21,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:21,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080646048] [2021-11-05 13:35:21,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080646048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:21,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:21,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 13:35:21,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749949807] [2021-11-05 13:35:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:21,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:35:21,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:35:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:35:21,529 INFO L87 Difference]: Start difference. First operand 3600 states and 4561 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:22,945 INFO L93 Difference]: Finished difference Result 10287 states and 12993 transitions. [2021-11-05 13:35:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:35:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-11-05 13:35:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:22,957 INFO L225 Difference]: With dead ends: 10287 [2021-11-05 13:35:22,957 INFO L226 Difference]: Without dead ends: 6769 [2021-11-05 13:35:22,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.34ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:35:22,964 INFO L933 BasicCegarLoop]: 7926 mSDtfsCounter, 3826 mSDsluCounter, 19611 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1019.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3826 SdHoareTripleChecker+Valid, 27537 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.53ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1124.51ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:22,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3826 Valid, 27537 Invalid, 538 Unknown, 0 Unchecked, 16.53ms Time], IncrementalHoareTripleChecker [91 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 1124.51ms Time] [2021-11-05 13:35:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2021-11-05 13:35:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 3714. [2021-11-05 13:35:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3627 states have (on average 1.2994210090984284) internal successors, (4713), 3713 states have internal predecessors, (4713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4713 transitions. [2021-11-05 13:35:23,121 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4713 transitions. Word has length 138 [2021-11-05 13:35:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:23,121 INFO L470 AbstractCegarLoop]: Abstraction has 3714 states and 4713 transitions. [2021-11-05 13:35:23,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4713 transitions. [2021-11-05 13:35:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-05 13:35:23,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:23,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:23,160 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-11-05 13:35:23,339 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,SelfDestructingSolverStorable10 [2021-11-05 13:35:23,340 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 917748154, now seen corresponding path program 1 times [2021-11-05 13:35:23,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:23,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311699629] [2021-11-05 13:35:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:23,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:23,422 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:23,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860943269] [2021-11-05 13:35:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:23,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:23,424 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-11-05 13:35:23,443 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-11-05 13:35:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:24,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 3217 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-05 13:35:24,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:25,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:25,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:25,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311699629] [2021-11-05 13:35:25,045 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:25,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860943269] [2021-11-05 13:35:25,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860943269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:25,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:25,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 13:35:25,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40898810] [2021-11-05 13:35:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:25,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:35:25,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:35:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:35:25,047 INFO L87 Difference]: Start difference. First operand 3714 states and 4713 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:27,106 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:35:29,215 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:35:31,324 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:35:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:52,399 INFO L93 Difference]: Finished difference Result 10391 states and 13155 transitions. [2021-11-05 13:35:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 13:35:52,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-11-05 13:35:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:52,410 INFO L225 Difference]: With dead ends: 10391 [2021-11-05 13:35:52,410 INFO L226 Difference]: Without dead ends: 6756 [2021-11-05 13:35:52,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 382.93ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:35:52,417 INFO L933 BasicCegarLoop]: 6632 mSDtfsCounter, 3397 mSDsluCounter, 21200 mSDsCounter, 0 mSdLazyCounter, 6348 mSolverCounterSat, 148 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23863.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 27832 SdHoareTripleChecker+Invalid, 6499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 67.80ms SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 6348 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26571.32ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:52,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3397 Valid, 27832 Invalid, 6499 Unknown, 0 Unchecked, 67.80ms Time], IncrementalHoareTripleChecker [148 Valid, 6348 Invalid, 3 Unknown, 0 Unchecked, 26571.32ms Time] [2021-11-05 13:35:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2021-11-05 13:35:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 3790. [2021-11-05 13:35:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3703 states have (on average 1.2984066972724817) internal successors, (4808), 3789 states have internal predecessors, (4808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4808 transitions. [2021-11-05 13:35:52,584 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 4808 transitions. Word has length 138 [2021-11-05 13:35:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:52,585 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 4808 transitions. [2021-11-05 13:35:52,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4808 transitions. [2021-11-05 13:35:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-05 13:35:52,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:52,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:52,619 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-11-05 13:35:52,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:52,812 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -8145414, now seen corresponding path program 1 times [2021-11-05 13:35:52,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:52,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224920743] [2021-11-05 13:35:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:52,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:52,886 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:52,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608258280] [2021-11-05 13:35:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:52,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:52,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:52,888 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-11-05 13:35:52,892 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-11-05 13:35:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:53,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 3211 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 13:35:53,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:35:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:35:54,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 13:35:54,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:35:54,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224920743] [2021-11-05 13:35:54,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:35:54,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608258280] [2021-11-05 13:35:54,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608258280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 13:35:54,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:35:54,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 13:35:54,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66980062] [2021-11-05 13:35:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 13:35:54,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:35:54,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 13:35:54,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:35:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:35:54,098 INFO L87 Difference]: Start difference. First operand 3790 states and 4808 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:35:54,871 INFO L93 Difference]: Finished difference Result 7649 states and 9702 transitions. [2021-11-05 13:35:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:35:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-11-05 13:35:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:35:54,877 INFO L225 Difference]: With dead ends: 7649 [2021-11-05 13:35:54,877 INFO L226 Difference]: Without dead ends: 3942 [2021-11-05 13:35:54,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.34ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:35:54,882 INFO L933 BasicCegarLoop]: 4255 mSDtfsCounter, 52 mSDsluCounter, 8385 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 567.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 12640 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.68ms SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 634.31ms IncrementalHoareTripleChecker+Time [2021-11-05 13:35:54,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 12640 Invalid, 326 Unknown, 0 Unchecked, 6.68ms Time], IncrementalHoareTripleChecker [73 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 634.31ms Time] [2021-11-05 13:35:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2021-11-05 13:35:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3866. [2021-11-05 13:35:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3779 states have (on average 1.2924053982535062) internal successors, (4884), 3865 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 4884 transitions. [2021-11-05 13:35:55,019 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 4884 transitions. Word has length 138 [2021-11-05 13:35:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:35:55,020 INFO L470 AbstractCegarLoop]: Abstraction has 3866 states and 4884 transitions. [2021-11-05 13:35:55,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:35:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 4884 transitions. [2021-11-05 13:35:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-05 13:35:55,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:35:55,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:35:55,053 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-11-05 13:35:55,235 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,SelfDestructingSolverStorable12 [2021-11-05 13:35:55,235 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:35:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:35:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2002402758, now seen corresponding path program 1 times [2021-11-05 13:35:55,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 13:35:55,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708600668] [2021-11-05 13:35:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:55,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 13:35:55,303 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-05 13:35:55,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187816492] [2021-11-05 13:35:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:35:55,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 13:35:55,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:35:55,305 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-11-05 13:35:55,307 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-11-05 13:35:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:35:56,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 3201 conjuncts, 142 conjunts are in the unsatisfiable core [2021-11-05 13:35:56,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:36:02,544 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-11-05 13:36:02,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 431 treesize of output 441 [2021-11-05 13:36:06,795 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-11-05 13:36:06,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 526 treesize of output 536 [2021-11-05 13:36:06,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 13:36:06,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708600668] [2021-11-05 13:36:06,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-05 13:36:06,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187816492] [2021-11-05 13:36:06,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-05 13:36:06,841 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:36:06,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-05 13:36:06,841 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-05 13:36:06,841 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-05 13:36:06,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (86 of 87 remaining) [2021-11-05 13:36:06,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (85 of 87 remaining) [2021-11-05 13:36:06,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (84 of 87 remaining) [2021-11-05 13:36:06,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (83 of 87 remaining) [2021-11-05 13:36:06,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (82 of 87 remaining) [2021-11-05 13:36:06,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (81 of 87 remaining) [2021-11-05 13:36:06,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (80 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (79 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (78 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (77 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (76 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (75 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (74 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (73 of 87 remaining) [2021-11-05 13:36:06,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (72 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (71 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (70 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (69 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (68 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (67 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (66 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (65 of 87 remaining) [2021-11-05 13:36:06,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (64 of 87 remaining) [2021-11-05 13:36:06,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (63 of 87 remaining) [2021-11-05 13:36:06,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (62 of 87 remaining) [2021-11-05 13:36:06,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (61 of 87 remaining) [2021-11-05 13:36:06,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (60 of 87 remaining) [2021-11-05 13:36:06,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (59 of 87 remaining) [2021-11-05 13:36:06,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (58 of 87 remaining) [2021-11-05 13:36:06,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (57 of 87 remaining) [2021-11-05 13:36:06,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (56 of 87 remaining) [2021-11-05 13:36:06,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (55 of 87 remaining) [2021-11-05 13:36:06,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (54 of 87 remaining) [2021-11-05 13:36:06,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (53 of 87 remaining) [2021-11-05 13:36:06,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (52 of 87 remaining) [2021-11-05 13:36:06,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (51 of 87 remaining) [2021-11-05 13:36:06,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION (50 of 87 remaining) [2021-11-05 13:36:06,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION (49 of 87 remaining) [2021-11-05 13:36:06,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION (48 of 87 remaining) [2021-11-05 13:36:06,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION (47 of 87 remaining) [2021-11-05 13:36:06,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION (46 of 87 remaining) [2021-11-05 13:36:06,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION (45 of 87 remaining) [2021-11-05 13:36:06,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION (44 of 87 remaining) [2021-11-05 13:36:06,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION (43 of 87 remaining) [2021-11-05 13:36:06,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (42 of 87 remaining) [2021-11-05 13:36:06,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (41 of 87 remaining) [2021-11-05 13:36:06,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION (40 of 87 remaining) [2021-11-05 13:36:06,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION (39 of 87 remaining) [2021-11-05 13:36:06,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (38 of 87 remaining) [2021-11-05 13:36:06,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (37 of 87 remaining) [2021-11-05 13:36:06,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION (36 of 87 remaining) [2021-11-05 13:36:06,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION (35 of 87 remaining) [2021-11-05 13:36:06,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION (34 of 87 remaining) [2021-11-05 13:36:06,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION (33 of 87 remaining) [2021-11-05 13:36:06,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION (32 of 87 remaining) [2021-11-05 13:36:06,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION (31 of 87 remaining) [2021-11-05 13:36:06,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION (30 of 87 remaining) [2021-11-05 13:36:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION (29 of 87 remaining) [2021-11-05 13:36:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION (28 of 87 remaining) [2021-11-05 13:36:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION (27 of 87 remaining) [2021-11-05 13:36:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION (26 of 87 remaining) [2021-11-05 13:36:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION (25 of 87 remaining) [2021-11-05 13:36:06,859 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION (24 of 87 remaining) [2021-11-05 13:36:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION (23 of 87 remaining) [2021-11-05 13:36:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION (22 of 87 remaining) [2021-11-05 13:36:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION (21 of 87 remaining) [2021-11-05 13:36:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION (20 of 87 remaining) [2021-11-05 13:36:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION (19 of 87 remaining) [2021-11-05 13:36:06,860 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION (18 of 87 remaining) [2021-11-05 13:36:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (17 of 87 remaining) [2021-11-05 13:36:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION (16 of 87 remaining) [2021-11-05 13:36:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION (15 of 87 remaining) [2021-11-05 13:36:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION (14 of 87 remaining) [2021-11-05 13:36:06,861 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION (13 of 87 remaining) [2021-11-05 13:36:06,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION (12 of 87 remaining) [2021-11-05 13:36:06,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION (11 of 87 remaining) [2021-11-05 13:36:06,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION (10 of 87 remaining) [2021-11-05 13:36:06,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION (9 of 87 remaining) [2021-11-05 13:36:06,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION (8 of 87 remaining) [2021-11-05 13:36:06,862 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION (7 of 87 remaining) [2021-11-05 13:36:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION (6 of 87 remaining) [2021-11-05 13:36:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION (5 of 87 remaining) [2021-11-05 13:36:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION (4 of 87 remaining) [2021-11-05 13:36:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION (3 of 87 remaining) [2021-11-05 13:36:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION (2 of 87 remaining) [2021-11-05 13:36:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION (1 of 87 remaining) [2021-11-05 13:36:06,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION (0 of 87 remaining) [2021-11-05 13:36:06,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-05 13:36:07,064 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,SelfDestructingSolverStorable13 [2021-11-05 13:36:07,067 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:36:07,069 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-05 13:36:07,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 01:36:07 BoogieIcfgContainer [2021-11-05 13:36:07,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-05 13:36:07,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-05 13:36:07,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-05 13:36:07,122 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-05 13:36:07,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:34:33" (3/4) ... [2021-11-05 13:36:07,125 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-05 13:36:07,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-05 13:36:07,126 INFO L158 Benchmark]: Toolchain (without parser) took 120127.97ms. Allocated memory was 62.9MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 34.8MB in the beginning and 351.9MB in the end (delta: -317.1MB). Peak memory consumption was 737.2MB. Max. memory is 16.1GB. [2021-11-05 13:36:07,126 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 13:36:07,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2181.44ms. Allocated memory was 62.9MB in the beginning and 107.0MB in the end (delta: 44.0MB). Free memory was 34.7MB in the beginning and 49.1MB in the end (delta: -14.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2021-11-05 13:36:07,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 634.29ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 49.1MB in the beginning and 63.0MB in the end (delta: -13.8MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2021-11-05 13:36:07,127 INFO L158 Benchmark]: Boogie Preprocessor took 856.23ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 63.0MB in the beginning and 253.4MB in the end (delta: -190.4MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-11-05 13:36:07,127 INFO L158 Benchmark]: RCFGBuilder took 22629.78ms. Allocated memory was 369.1MB in the beginning and 929.0MB in the end (delta: 559.9MB). Free memory was 253.4MB in the beginning and 436.4MB in the end (delta: -183.0MB). Peak memory consumption was 575.0MB. Max. memory is 16.1GB. [2021-11-05 13:36:07,127 INFO L158 Benchmark]: TraceAbstraction took 93814.29ms. Allocated memory was 929.0MB in the beginning and 1.1GB in the end (delta: 186.6MB). Free memory was 435.3MB in the beginning and 351.9MB in the end (delta: 83.5MB). Peak memory consumption was 271.1MB. Max. memory is 16.1GB. [2021-11-05 13:36:07,128 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 1.1GB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-05 13:36:07,129 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.23ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2181.44ms. Allocated memory was 62.9MB in the beginning and 107.0MB in the end (delta: 44.0MB). Free memory was 34.7MB in the beginning and 49.1MB in the end (delta: -14.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 634.29ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 49.1MB in the beginning and 63.0MB in the end (delta: -13.8MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 856.23ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 63.0MB in the beginning and 253.4MB in the end (delta: -190.4MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * RCFGBuilder took 22629.78ms. Allocated memory was 369.1MB in the beginning and 929.0MB in the end (delta: 559.9MB). Free memory was 253.4MB in the beginning and 436.4MB in the end (delta: -183.0MB). Peak memory consumption was 575.0MB. Max. memory is 16.1GB. * TraceAbstraction took 93814.29ms. Allocated memory was 929.0MB in the beginning and 1.1GB in the end (delta: 186.6MB). Free memory was 435.3MB in the beginning and 351.9MB in the end (delta: 83.5MB). Peak memory consumption was 271.1MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 1.1GB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 7788. Possible FailurePath: [L6915-L6920] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7360] static __thread int tl_last_error = 0; [L7787-L7935] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L7938-L7941] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L7943-L7952] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L7954-L7957] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L7959-L7963] static _Bool s_common_library_initialized = 0 ; [L8450] struct aws_priority_queue queue; [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6789-L6791] _Bool container_is_bounded = aws_array_list_is_bounded(&queue->container, max_initial_item_allocation, max_item_size); [L6735] EXPR list->item_size [L6734-L6735] _Bool item_size_is_bounded = list->item_size <= max_item_size; [L6738] EXPR list->length [L6737-L6738] _Bool length_is_bounded = list->length <= max_initial_item_allocation; [L6739] return item_size_is_bounded && length_is_bounded; [L6797-L6799] _Bool backpointers_list_is_bounded = aws_array_list_is_bounded( &queue->backpointers, max_initial_item_allocation, sizeof(struct aws_priority_queue_node *)); [L6800] return container_is_bounded && backpointers_list_is_bounded; [L211] COND FALSE !(!cond) [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] list->data [L211] COND FALSE !(!cond) [L6939] return &s_can_fail_allocator_static; [L6747] list->alloc = can_fail_allocator() [L6743] EXPR list->current_size [L6743] list->current_size == 0 && list->length == 0 [L6743] EXPR list->length [L6743] list->current_size == 0 && list->length == 0 [L6743] COND TRUE list->current_size == 0 && list->length == 0 [L6744] list->data [L211] COND FALSE !(!cond) [L6939] return &s_can_fail_allocator_static; [L6747] list->alloc = can_fail_allocator() [L6806] queue->pred = nondet_compare [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8220] COND FALSE !(!queue) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8231] EXPR queue->backpointers.data [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L211] COND FALSE !(!cond) [L8458] EXPR queue.container.item_size [L261] return __VERIFIER_nondet_bool(); [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L211] COND FALSE !(!cond) [L6935] return malloc(size); [L6949-L6951] EXPR nondet_bool() ? ((void *)0) : bounded_malloc(size) [L6949-L6951] return nondet_bool() ? ((void *)0) : bounded_malloc(size); [L8458] void *item = can_fail_malloc(queue.container.item_size); [L8460] queue.backpointers.data [L8460] COND FALSE !(queue.backpointers.data) [L8476] struct aws_priority_queue old_queue = queue; [L8479] item && ((((queue.container.item_size)) == 0) || ((item))) [L8479] EXPR queue.container.item_size [L8479] item && ((((queue.container.item_size)) == 0) || ((item))) [L211] COND FALSE !(!cond) [L8279] COND FALSE !(!queue) [L8286] EXPR queue->pred [L8285-L8288] _Bool pred_is_valid = (queue->pred != ((void *)0) ); [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8290-L8291] _Bool container_is_valid = aws_array_list_is_valid(&queue->container); [L8220] COND FALSE !(!queue) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230] EXPR queue->backpointers.current_size [L8230] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8231] EXPR queue->backpointers.data [L8230-L8233] EXPR aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ) [L8228-L8233] _Bool backpointer_list_is_valid = ((aws_array_list_is_valid(&queue->backpointers) && (queue->backpointers.current_size != 0) && (queue->backpointers.data != ((void *)0) ))); [L8241] EXPR queue->backpointers.item_size [L8240-L8241] _Bool backpointer_list_item_size = queue->backpointers.item_size == sizeof(struct aws_priority_queue_node *); [L8244] EXPR queue->backpointers.length [L8244] EXPR queue->container.length [L8243-L8244] _Bool lists_equal_lengths = queue->backpointers.length == queue->container.length; [L8247] EXPR queue->backpointers.current_size [L8246-L8247] _Bool backpointers_non_zero_current_size = queue->backpointers.current_size > 0; [L8255-L8258] _Bool backpointers_valid_deep = 1 ; [L8263] EXPR queue->backpointers.current_size [L8263] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 [L8263-L8264] EXPR queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) [L8261-L8265] _Bool backpointers_zero = (queue->backpointers.current_size == 0 && queue->backpointers.length == 0 && queue->backpointers.data == ((void *)0) ); [L8267-L8270] _Bool backpointer_struct_is_valid = backpointers_zero || (backpointer_list_item_size && lists_equal_lengths && backpointers_non_zero_current_size && backpointers_valid_deep); [L8272] EXPR (backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers)) [L8272] return ((backpointer_list_is_valid && backpointer_struct_is_valid) || aws_is_mem_zeroed(&(queue->backpointers), sizeof(queue->backpointers))); [L8294-L8295] _Bool backpointers_valid = aws_priority_queue_backpointers_valid(queue); [L8296] return pred_is_valid && container_is_valid && backpointers_valid; [L211] COND FALSE !(!cond) [L8428] item && ((((queue->container.item_size)) == 0) || ((item))) [L8428] EXPR queue->container.item_size [L8428] item && ((((queue->container.item_size)) == 0) || ((item))) [L211] COND FALSE !(!cond) [L3169] EXPR list->length [L3169] !list->length || list->data [L211] COND FALSE !(!cond) [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L211] COND FALSE !(!cond) [L3171] EXPR list->length [L3171] size_t len = list->length; [L2939] COND FALSE !(!list) [L2944] size_t required_size = 0; [L2948] EXPR list->length [L2948] EXPR list->item_size [L254] unsigned long c; [L255] return __builtin_umull_overflow(a, b, &c); [L255] return __builtin_umull_overflow(a, b, &c); [L2498] COND FALSE !(__CPROVER_overflow_mult(a, b)) [L2500] *r = a * b [L2501] return (0); [L2590] return aws_mul_u64_checked(a, b, (uint64_t *)r); [L2946-L2948] _Bool required_size_is_valid = (aws_mul_size_checked(list->length, list->item_size, &required_size) == (0)); [L2951] EXPR list->current_size [L2951] EXPR \read(required_size) [L2950-L2951] _Bool current_size_is_valid = (list->current_size >= required_size); [L2955] EXPR list->current_size [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955] EXPR list->data [L2955-L2956] EXPR list->current_size == 0 && list->data == ((void *)0) [L2955-L2957] EXPR (list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data))) [L2953-L2957] _Bool data_is_valid = ((list->current_size == 0 && list->data == ((void *)0) ) || ((((list->current_size)) == 0) || ((list->data)))); [L2960] EXPR list->item_size [L2959-L2960] _Bool item_size_is_valid = (list->item_size != 0); [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L2944] size_t required_size = 0; [L2961] return required_size_is_valid && current_size_is_valid && data_is_valid && item_size_is_valid; [L223] COND TRUE !cond [L223] reach_error() - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 233]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3341 locations, 87 error locations. Started 1 CEGAR loops. OverallTime: 93685.91ms, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 46.19ms, AutomataDifference: 61682.64ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 58.69ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 95406 SdHoareTripleChecker+Valid, 57095.84ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95406 mSDsluCounter, 205128 SdHoareTripleChecker+Invalid, 51874.03ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143357 mSDsCounter, 960 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14368 IncrementalHoareTripleChecker+Invalid, 15331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 960 mSolverCounterUnsat, 61771 mSDtfsCounter, 14368 mSolverCounterSat, 348.23ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1289 GetRequests, 1219 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1635.22ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3866occurred in iteration=13, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1772.74ms AutomataMinimizationTime, 13 MinimizatonAttempts, 28063 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1669.39ms SsaConstructionTime, 7072.90ms SatisfiabilityAnalysisTime, 16615.53ms InterpolantComputationTime, 1566 NumberOfCodeBlocks, 1566 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1415 ConstructedInterpolants, 0 QuantifiedInterpolants, 2235 SizeOfPredicates, 44 NumberOfNonLiveVariables, 34067 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-05 13:36:07,369 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-05 13:36:07,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 13:36:09,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 13:36:09,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 13:36:09,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 13:36:09,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 13:36:09,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 13:36:09,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 13:36:09,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 13:36:09,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 13:36:09,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 13:36:09,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 13:36:09,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 13:36:09,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 13:36:09,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 13:36:09,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 13:36:09,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 13:36:09,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 13:36:09,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 13:36:09,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 13:36:09,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 13:36:09,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 13:36:09,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 13:36:09,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 13:36:09,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 13:36:09,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 13:36:09,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 13:36:09,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 13:36:09,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 13:36:09,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 13:36:09,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 13:36:09,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 13:36:09,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 13:36:09,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 13:36:09,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 13:36:09,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 13:36:09,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 13:36:09,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 13:36:09,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 13:36:09,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 13:36:09,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 13:36:09,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 13:36:09,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-05 13:36:09,244 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 13:36:09,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 13:36:09,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 13:36:09,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 13:36:09,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 13:36:09,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 13:36:09,247 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 13:36:09,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 13:36:09,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 13:36:09,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 13:36:09,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 13:36:09,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 13:36:09,248 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-05 13:36:09,249 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-05 13:36:09,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 13:36:09,249 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 13:36:09,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 13:36:09,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 13:36:09,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 13:36:09,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 13:36:09,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:36:09,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 13:36:09,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 13:36:09,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 13:36:09,251 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-05 13:36:09,252 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-05 13:36:09,252 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 13:36:09,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 13:36:09,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 13:36:09,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 13:36:09,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-05 13:36:09,253 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71774aeec0d0f8840a1b18b633767b26c38c9eb9d26569d28cdf01c44c9881ac [2021-11-05 13:36:09,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 13:36:09,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 13:36:09,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 13:36:09,632 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 13:36:09,632 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 13:36:09,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i [2021-11-05 13:36:09,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec1b298e/368a43ff370245c79c9ddb4ed72e016f/FLAG3518bd4d6 [2021-11-05 13:36:10,506 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 13:36:10,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i [2021-11-05 13:36:10,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec1b298e/368a43ff370245c79c9ddb4ed72e016f/FLAG3518bd4d6 [2021-11-05 13:36:10,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec1b298e/368a43ff370245c79c9ddb4ed72e016f [2021-11-05 13:36:10,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 13:36:10,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 13:36:10,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 13:36:10,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 13:36:10,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 13:36:10,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:36:10" (1/1) ... [2021-11-05 13:36:10,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebeecf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:10, skipping insertion in model container [2021-11-05 13:36:10,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 01:36:10" (1/1) ... [2021-11-05 13:36:10,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 13:36:10,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 13:36:11,045 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4496,4509] [2021-11-05 13:36:11,052 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4556,4569] [2021-11-05 13:36:11,071 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:36:11,077 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:36:11,792 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,793 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,794 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,794 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,795 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,807 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,808 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,810 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,810 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,812 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,812 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,813 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:11,813 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,054 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:36:12,055 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:36:12,056 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:36:12,057 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:36:12,058 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:36:12,058 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:36:12,059 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:36:12,059 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:36:12,060 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:36:12,060 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:36:12,179 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:36:12,217 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,228 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,326 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,331 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,332 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,332 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,338 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,341 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,341 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,343 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,344 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,345 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,345 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,345 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,346 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,351 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,353 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,353 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,353 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,362 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,363 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,375 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,376 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,377 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:36:12,451 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 13:36:12,478 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4496,4509] [2021-11-05 13:36:12,479 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_pop_harness.i[4556,4569] [2021-11-05 13:36:12,483 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 13:36:12,486 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 13:36:12,543 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,544 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,544 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,544 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,545 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,555 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,555 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,556 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,556 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,557 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,558 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,558 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,558 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,608 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 13:36:12,609 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 13:36:12,610 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 13:36:12,610 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 13:36:12,613 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 13:36:12,613 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 13:36:12,615 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 13:36:12,615 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 13:36:12,616 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 13:36:12,616 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 13:36:12,642 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 13:36:12,659 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,675 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,708 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,709 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,710 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,710 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,710 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,710 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,711 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,712 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,712 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,712 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,713 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,713 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,714 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,714 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,715 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,715 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,715 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,718 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,718 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,724 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,725 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,725 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 13:36:12,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 13:36:13,006 INFO L208 MainTranslator]: Completed translation [2021-11-05 13:36:13,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13 WrapperNode [2021-11-05 13:36:13,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 13:36:13,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 13:36:13,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 13:36:13,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 13:36:13,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:13,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:13,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 13:36:13,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 13:36:13,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 13:36:13,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 13:36:13,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:13,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:13,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:13,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:14,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:14,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:14,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:14,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 13:36:14,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 13:36:14,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 13:36:14,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 13:36:14,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (1/1) ... [2021-11-05 13:36:14,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 13:36:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 13:36:14,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 13:36:14,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 13:36:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 13:36:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-05 13:36:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 13:36:14,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-05 13:36:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-05 13:36:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 13:36:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-05 13:36:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 13:36:14,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-05 13:36:14,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 13:36:14,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-05 13:37:00,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 13:37:00,987 INFO L299 CfgBuilder]: Removed 2646 assume(true) statements. [2021-11-05 13:37:00,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:37:00 BoogieIcfgContainer [2021-11-05 13:37:00,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 13:37:00,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 13:37:00,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 13:37:00,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 13:37:00,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 01:36:10" (1/3) ... [2021-11-05 13:37:00,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2616593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:37:00, skipping insertion in model container [2021-11-05 13:37:00,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 01:36:13" (2/3) ... [2021-11-05 13:37:00,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2616593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 01:37:00, skipping insertion in model container [2021-11-05 13:37:00,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 01:37:00" (3/3) ... [2021-11-05 13:37:01,000 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_pop_harness.i [2021-11-05 13:37:01,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 13:37:01,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2021-11-05 13:37:01,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 13:37:01,064 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-05 13:37:01,064 INFO L340 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2021-11-05 13:37:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 3341 states, 3253 states have (on average 1.4223793421457116) internal successors, (4627), 3340 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 13:37:01,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:01,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:01,131 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash 462763660, now seen corresponding path program 1 times [2021-11-05 13:37:01,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:01,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035593433] [2021-11-05 13:37:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:01,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:01,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:01,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:01,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-05 13:37:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:37:03,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-05 13:37:03,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:37:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:03,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:37:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:03,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:37:03,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035593433] [2021-11-05 13:37:03,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035593433] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:37:03,792 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:37:03,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-05 13:37:03,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414063063] [2021-11-05 13:37:03,794 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:37:03,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 13:37:03,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:37:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 13:37:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:37:03,829 INFO L87 Difference]: Start difference. First operand has 3341 states, 3253 states have (on average 1.4223793421457116) internal successors, (4627), 3340 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:37:03,969 INFO L93 Difference]: Finished difference Result 6676 states and 9247 transitions. [2021-11-05 13:37:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 13:37:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 13:37:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:37:03,999 INFO L225 Difference]: With dead ends: 6676 [2021-11-05 13:37:04,000 INFO L226 Difference]: Without dead ends: 3336 [2021-11-05 13:37:04,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.33ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 13:37:04,023 INFO L933 BasicCegarLoop]: 4318 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.70ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 13:37:04,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 11.70ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 13:37:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-11-05 13:37:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3336. [2021-11-05 13:37:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.327485380116959) internal successors, (4313), 3335 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4313 transitions. [2021-11-05 13:37:04,169 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4313 transitions. Word has length 55 [2021-11-05 13:37:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:37:04,169 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4313 transitions. [2021-11-05 13:37:04,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4313 transitions. [2021-11-05 13:37:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 13:37:04,176 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:04,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:04,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-05 13:37:04,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:37:04,393 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -349284918, now seen corresponding path program 1 times [2021-11-05 13:37:04,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:04,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250256237] [2021-11-05 13:37:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:04,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:04,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:04,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-05 13:37:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:37:06,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 13:37:06,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:37:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:07,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:37:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:07,581 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:37:07,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250256237] [2021-11-05 13:37:07,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250256237] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:37:07,581 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:37:07,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-05 13:37:07,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281447866] [2021-11-05 13:37:07,582 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:37:07,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:37:07,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:37:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:37:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:37:07,584 INFO L87 Difference]: Start difference. First operand 3336 states and 4313 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:09,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:37:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:37:10,327 INFO L93 Difference]: Finished difference Result 6592 states and 8521 transitions. [2021-11-05 13:37:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:37:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 13:37:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:37:10,340 INFO L225 Difference]: With dead ends: 6592 [2021-11-05 13:37:10,340 INFO L226 Difference]: Without dead ends: 3336 [2021-11-05 13:37:10,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:37:10,347 INFO L933 BasicCegarLoop]: 4302 mSDtfsCounter, 215 mSDsluCounter, 8309 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2506.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 12611 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2599.37ms IncrementalHoareTripleChecker+Time [2021-11-05 13:37:10,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 12611 Invalid, 89 Unknown, 0 Unchecked, 18.24ms Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 2599.37ms Time] [2021-11-05 13:37:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-11-05 13:37:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3336. [2021-11-05 13:37:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.327177593105571) internal successors, (4312), 3335 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4312 transitions. [2021-11-05 13:37:10,418 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4312 transitions. Word has length 55 [2021-11-05 13:37:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:37:10,418 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4312 transitions. [2021-11-05 13:37:10,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4312 transitions. [2021-11-05 13:37:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-05 13:37:10,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:10,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:10,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-05 13:37:10,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:37:10,644 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1031328699, now seen corresponding path program 1 times [2021-11-05 13:37:10,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:10,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818029610] [2021-11-05 13:37:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:10,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:10,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:10,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-05 13:37:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:37:12,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 13:37:12,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:37:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:13,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:37:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:13,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:37:13,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818029610] [2021-11-05 13:37:13,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818029610] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:37:13,938 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:37:13,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 13:37:13,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486813166] [2021-11-05 13:37:13,938 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:37:13,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 13:37:13,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:37:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 13:37:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:37:13,939 INFO L87 Difference]: Start difference. First operand 3336 states and 4312 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:16,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:37:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:37:29,758 INFO L93 Difference]: Finished difference Result 9049 states and 11599 transitions. [2021-11-05 13:37:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:37:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-05 13:37:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:37:29,783 INFO L225 Difference]: With dead ends: 9049 [2021-11-05 13:37:29,784 INFO L226 Difference]: Without dead ends: 5761 [2021-11-05 13:37:29,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 281.49ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:37:29,794 INFO L933 BasicCegarLoop]: 4295 mSDtfsCounter, 6579 mSDsluCounter, 14779 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13803.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6579 SdHoareTripleChecker+Valid, 19074 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 60.15ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15365.64ms IncrementalHoareTripleChecker+Time [2021-11-05 13:37:29,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6579 Valid, 19074 Invalid, 2223 Unknown, 0 Unchecked, 60.15ms Time], IncrementalHoareTripleChecker [36 Valid, 2186 Invalid, 1 Unknown, 0 Unchecked, 15365.64ms Time] [2021-11-05 13:37:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5761 states. [2021-11-05 13:37:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5761 to 3336. [2021-11-05 13:37:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3268698060941828) internal successors, (4311), 3335 states have internal predecessors, (4311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4311 transitions. [2021-11-05 13:37:29,937 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4311 transitions. Word has length 59 [2021-11-05 13:37:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:37:29,938 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4311 transitions. [2021-11-05 13:37:29,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4311 transitions. [2021-11-05 13:37:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-05 13:37:29,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:29,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:29,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-05 13:37:30,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:37:30,157 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash -321488865, now seen corresponding path program 1 times [2021-11-05 13:37:30,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:30,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568824720] [2021-11-05 13:37:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:30,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:30,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:30,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:30,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-05 13:37:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:37:32,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 13:37:32,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:37:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:33,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:37:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:33,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:37:33,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568824720] [2021-11-05 13:37:33,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568824720] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:37:33,783 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:37:33,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 13:37:33,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710558815] [2021-11-05 13:37:33,783 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:37:33,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:37:33,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:37:33,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:37:33,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:37:33,784 INFO L87 Difference]: Start difference. First operand 3336 states and 4311 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:35,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:37:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:37:37,492 INFO L93 Difference]: Finished difference Result 6593 states and 8520 transitions. [2021-11-05 13:37:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:37:37,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-05 13:37:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:37:37,503 INFO L225 Difference]: With dead ends: 6593 [2021-11-05 13:37:37,503 INFO L226 Difference]: Without dead ends: 3336 [2021-11-05 13:37:37,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 158.87ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:37:37,510 INFO L933 BasicCegarLoop]: 4293 mSDtfsCounter, 277 mSDsluCounter, 12376 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3348.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 16669 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.55ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3539.81ms IncrementalHoareTripleChecker+Time [2021-11-05 13:37:37,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 16669 Invalid, 261 Unknown, 0 Unchecked, 11.55ms Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 3539.81ms Time] [2021-11-05 13:37:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-11-05 13:37:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3336. [2021-11-05 13:37:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3265620190827947) internal successors, (4310), 3335 states have internal predecessors, (4310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4310 transitions. [2021-11-05 13:37:37,578 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4310 transitions. Word has length 67 [2021-11-05 13:37:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:37:37,579 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4310 transitions. [2021-11-05 13:37:37,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4310 transitions. [2021-11-05 13:37:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-05 13:37:37,580 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:37,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:37,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-05 13:37:37,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:37:37,797 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1460829938, now seen corresponding path program 1 times [2021-11-05 13:37:37,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:37,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424118920] [2021-11-05 13:37:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:37,800 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:37,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:37,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-05 13:37:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:37:40,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:37:40,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:37:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:40,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:37:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:41,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:37:41,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424118920] [2021-11-05 13:37:41,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424118920] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:37:41,403 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:37:41,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-05 13:37:41,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752979409] [2021-11-05 13:37:41,404 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:37:41,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:37:41,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:37:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:37:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:37:41,405 INFO L87 Difference]: Start difference. First operand 3336 states and 4310 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:43,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:37:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:37:53,048 INFO L93 Difference]: Finished difference Result 6609 states and 8542 transitions. [2021-11-05 13:37:53,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:37:53,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-05 13:37:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:37:53,066 INFO L225 Difference]: With dead ends: 6609 [2021-11-05 13:37:53,066 INFO L226 Difference]: Without dead ends: 3336 [2021-11-05 13:37:53,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 234.82ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:37:53,074 INFO L933 BasicCegarLoop]: 4280 mSDtfsCounter, 363 mSDsluCounter, 15542 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9948.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 19822 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.77ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11316.78ms IncrementalHoareTripleChecker+Time [2021-11-05 13:37:53,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 19822 Invalid, 1325 Unknown, 0 Unchecked, 25.77ms Time], IncrementalHoareTripleChecker [4 Valid, 1320 Invalid, 1 Unknown, 0 Unchecked, 11316.78ms Time] [2021-11-05 13:37:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-11-05 13:37:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3336. [2021-11-05 13:37:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3249 states have (on average 1.3262542320714066) internal successors, (4309), 3335 states have internal predecessors, (4309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4309 transitions. [2021-11-05 13:37:53,153 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4309 transitions. Word has length 79 [2021-11-05 13:37:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:37:53,153 INFO L470 AbstractCegarLoop]: Abstraction has 3336 states and 4309 transitions. [2021-11-05 13:37:53,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4309 transitions. [2021-11-05 13:37:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 13:37:53,154 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:53,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:53,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-05 13:37:53,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:37:53,371 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1730269398, now seen corresponding path program 1 times [2021-11-05 13:37:53,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:53,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794633135] [2021-11-05 13:37:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:53,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:53,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:53,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:53,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-05 13:37:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:37:56,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 13:37:56,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:37:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:56,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:37:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:37:56,813 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:37:56,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794633135] [2021-11-05 13:37:56,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794633135] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:37:56,814 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:37:56,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 13:37:56,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226217035] [2021-11-05 13:37:56,814 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:37:56,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:37:56,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:37:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:37:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:37:56,815 INFO L87 Difference]: Start difference. First operand 3336 states and 4309 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:37:59,206 INFO L93 Difference]: Finished difference Result 9539 states and 12277 transitions. [2021-11-05 13:37:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:37:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 13:37:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:37:59,227 INFO L225 Difference]: With dead ends: 9539 [2021-11-05 13:37:59,228 INFO L226 Difference]: Without dead ends: 6281 [2021-11-05 13:37:59,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 97.24ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:37:59,236 INFO L933 BasicCegarLoop]: 7946 mSDtfsCounter, 3834 mSDsluCounter, 19663 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2031.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3834 SdHoareTripleChecker+Valid, 27609 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.16ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2202.43ms IncrementalHoareTripleChecker+Time [2021-11-05 13:37:59,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3834 Valid, 27609 Invalid, 538 Unknown, 0 Unchecked, 24.16ms Time], IncrementalHoareTripleChecker [91 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 2202.43ms Time] [2021-11-05 13:37:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2021-11-05 13:37:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 3450. [2021-11-05 13:37:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3363 states have (on average 1.326494201605709) internal successors, (4461), 3449 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4461 transitions. [2021-11-05 13:37:59,331 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4461 transitions. Word has length 87 [2021-11-05 13:37:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:37:59,333 INFO L470 AbstractCegarLoop]: Abstraction has 3450 states and 4461 transitions. [2021-11-05 13:37:59,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:37:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4461 transitions. [2021-11-05 13:37:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 13:37:59,336 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:37:59,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:37:59,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-05 13:37:59,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:37:59,541 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:37:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:37:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -832876120, now seen corresponding path program 1 times [2021-11-05 13:37:59,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:37:59,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035733712] [2021-11-05 13:37:59,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:37:59,545 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:37:59,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:37:59,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:37:59,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-05 13:38:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:38:02,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 13:38:02,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:38:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:02,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:38:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:38:03,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:38:03,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035733712] [2021-11-05 13:38:03,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035733712] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:38:03,438 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:38:03,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-05 13:38:03,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277280684] [2021-11-05 13:38:03,438 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:38:03,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 13:38:03,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:38:03,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 13:38:03,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:38:03,439 INFO L87 Difference]: Start difference. First operand 3450 states and 4461 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:38:05,656 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:38:07,669 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:38:11,335 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:39:27,067 INFO L93 Difference]: Finished difference Result 9519 states and 12236 transitions. [2021-11-05 13:39:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 13:39:27,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 13:39:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:39:27,085 INFO L225 Difference]: With dead ends: 9519 [2021-11-05 13:39:27,085 INFO L226 Difference]: Without dead ends: 6144 [2021-11-05 13:39:27,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 945.47ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-05 13:39:27,094 INFO L933 BasicCegarLoop]: 6629 mSDtfsCounter, 6788 mSDsluCounter, 18387 mSDsCounter, 0 mSdLazyCounter, 5382 mSolverCounterSat, 305 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74103.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6788 SdHoareTripleChecker+Valid, 25016 SdHoareTripleChecker+Invalid, 5690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 94.70ms SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 5382 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82674.95ms IncrementalHoareTripleChecker+Time [2021-11-05 13:39:27,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6788 Valid, 25016 Invalid, 5690 Unknown, 0 Unchecked, 94.70ms Time], IncrementalHoareTripleChecker [305 Valid, 5382 Invalid, 3 Unknown, 0 Unchecked, 82674.95ms Time] [2021-11-05 13:39:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6144 states. [2021-11-05 13:39:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6144 to 3450. [2021-11-05 13:39:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3363 states have (on average 1.320844484091585) internal successors, (4442), 3449 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4442 transitions. [2021-11-05 13:39:27,184 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4442 transitions. Word has length 87 [2021-11-05 13:39:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:39:27,184 INFO L470 AbstractCegarLoop]: Abstraction has 3450 states and 4442 transitions. [2021-11-05 13:39:27,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4442 transitions. [2021-11-05 13:39:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 13:39:27,186 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:39:27,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:39:27,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-05 13:39:27,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:39:27,408 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:39:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:39:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash -409229398, now seen corresponding path program 1 times [2021-11-05 13:39:27,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:39:27,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542193040] [2021-11-05 13:39:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:39:27,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:39:27,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:39:27,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:39:27,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-05 13:39:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:39:29,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:39:29,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:39:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:30,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:39:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:39:31,291 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:39:31,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542193040] [2021-11-05 13:39:31,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542193040] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:39:31,292 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:39:31,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2021-11-05 13:39:31,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584461764] [2021-11-05 13:39:31,292 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:39:31,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 13:39:31,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:39:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 13:39:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:39:31,293 INFO L87 Difference]: Start difference. First operand 3450 states and 4442 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:39:33,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:35,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:37,511 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:39,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:41,525 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:39:46,152 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:42:05,802 INFO L93 Difference]: Finished difference Result 9538 states and 12217 transitions. [2021-11-05 13:42:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 13:42:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 13:42:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:42:05,817 INFO L225 Difference]: With dead ends: 9538 [2021-11-05 13:42:05,817 INFO L226 Difference]: Without dead ends: 6163 [2021-11-05 13:42:05,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1145.65ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-05 13:42:05,825 INFO L933 BasicCegarLoop]: 6598 mSDtfsCounter, 3430 mSDsluCounter, 34062 mSDsCounter, 0 mSdLazyCounter, 9761 mSolverCounterSat, 306 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 138496.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3430 SdHoareTripleChecker+Valid, 40660 SdHoareTripleChecker+Invalid, 10073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 134.22ms SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 9761 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 153224.85ms IncrementalHoareTripleChecker+Time [2021-11-05 13:42:05,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3430 Valid, 40660 Invalid, 10073 Unknown, 0 Unchecked, 134.22ms Time], IncrementalHoareTripleChecker [306 Valid, 9761 Invalid, 6 Unknown, 0 Unchecked, 153224.85ms Time] [2021-11-05 13:42:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6163 states. [2021-11-05 13:42:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6163 to 3488. [2021-11-05 13:42:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 3401 states have (on average 1.3116730373419583) internal successors, (4461), 3487 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:42:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4461 transitions. [2021-11-05 13:42:05,922 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4461 transitions. Word has length 87 [2021-11-05 13:42:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:42:05,922 INFO L470 AbstractCegarLoop]: Abstraction has 3488 states and 4461 transitions. [2021-11-05 13:42:05,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:42:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4461 transitions. [2021-11-05 13:42:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-05 13:42:05,924 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:42:05,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:42:06,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-05 13:42:06,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:42:06,140 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:42:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:42:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2040370732, now seen corresponding path program 1 times [2021-11-05 13:42:06,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:42:06,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678186829] [2021-11-05 13:42:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:42:06,144 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:42:06,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:42:06,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:42:06,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-05 13:42:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:42:08,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-05 13:42:08,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:42:10,907 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 40 treesize of output 28 [2021-11-05 13:42:10,919 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 25 treesize of output 13 [2021-11-05 13:42:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:42:11,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:42:14,247 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 13:42:14,247 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 40 treesize of output 43 [2021-11-05 13:42:14,319 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-05 13:42:14,319 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 39 treesize of output 34 [2021-11-05 13:42:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:42:14,931 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:42:14,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678186829] [2021-11-05 13:42:14,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678186829] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:42:14,932 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:42:14,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2021-11-05 13:42:14,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341714296] [2021-11-05 13:42:14,932 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:42:14,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 13:42:14,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:42:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 13:42:14,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-05 13:42:14,933 INFO L87 Difference]: Start difference. First operand 3488 states and 4461 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:42:17,158 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:19,172 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:21,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:26,497 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:29,325 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:42:35,056 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:44:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:44:57,195 INFO L93 Difference]: Finished difference Result 14473 states and 18398 transitions. [2021-11-05 13:44:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-05 13:44:57,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-05 13:44:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:44:57,226 INFO L225 Difference]: With dead ends: 14473 [2021-11-05 13:44:57,226 INFO L226 Difference]: Without dead ends: 11100 [2021-11-05 13:44:57,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3401.55ms TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2021-11-05 13:44:57,238 INFO L933 BasicCegarLoop]: 13006 mSDtfsCounter, 7391 mSDsluCounter, 67700 mSDsCounter, 0 mSdLazyCounter, 9256 mSolverCounterSat, 96 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 141790.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7391 SdHoareTripleChecker+Valid, 80706 SdHoareTripleChecker+Invalid, 9358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 173.58ms SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 9256 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 158765.24ms IncrementalHoareTripleChecker+Time [2021-11-05 13:44:57,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7391 Valid, 80706 Invalid, 9358 Unknown, 0 Unchecked, 173.58ms Time], IncrementalHoareTripleChecker [96 Valid, 9256 Invalid, 6 Unknown, 0 Unchecked, 158765.24ms Time] [2021-11-05 13:44:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11100 states. [2021-11-05 13:44:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11100 to 3501. [2021-11-05 13:44:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.310779144698301) internal successors, (4475), 3500 states have internal predecessors, (4475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4475 transitions. [2021-11-05 13:44:57,353 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4475 transitions. Word has length 87 [2021-11-05 13:44:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:44:57,354 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4475 transitions. [2021-11-05 13:44:57,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:44:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4475 transitions. [2021-11-05 13:44:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-05 13:44:57,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:44:57,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:44:57,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-05 13:44:57,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:44:57,576 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:44:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:44:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash 156640934, now seen corresponding path program 1 times [2021-11-05 13:44:57,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:44:57,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539103308] [2021-11-05 13:44:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:44:57,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:44:57,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:44:57,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:44:57,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-05 13:45:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:00,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:45:00,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:00,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:01,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:01,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539103308] [2021-11-05 13:45:01,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539103308] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:01,041 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:01,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-05 13:45:01,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378188902] [2021-11-05 13:45:01,042 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:01,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:45:01,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:45:01,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:45:01,043 INFO L87 Difference]: Start difference. First operand 3501 states and 4475 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:03,257 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:03,640 INFO L93 Difference]: Finished difference Result 6911 states and 8838 transitions. [2021-11-05 13:45:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 13:45:03,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-05 13:45:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:03,652 INFO L225 Difference]: With dead ends: 6911 [2021-11-05 13:45:03,652 INFO L226 Difference]: Without dead ends: 3540 [2021-11-05 13:45:03,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 322.09ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:45:03,660 INFO L933 BasicCegarLoop]: 4300 mSDtfsCounter, 37 mSDsluCounter, 17182 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2330.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21482 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.16ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2382.38ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:03,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 21482 Invalid, 66 Unknown, 0 Unchecked, 12.16ms Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2382.38ms Time] [2021-11-05 13:45:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2021-11-05 13:45:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 3525. [2021-11-05 13:45:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3438 states have (on average 1.3100639906922629) internal successors, (4504), 3524 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 4504 transitions. [2021-11-05 13:45:03,737 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 4504 transitions. Word has length 88 [2021-11-05 13:45:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:03,737 INFO L470 AbstractCegarLoop]: Abstraction has 3525 states and 4504 transitions. [2021-11-05 13:45:03,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 4504 transitions. [2021-11-05 13:45:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-05 13:45:03,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:03,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:45:03,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-05 13:45:03,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:45:03,960 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 297189544, now seen corresponding path program 1 times [2021-11-05 13:45:03,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:03,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6269728] [2021-11-05 13:45:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:03,966 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:03,968 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:45:03,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-05 13:45:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:06,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 1603 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-05 13:45:06,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:07,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:07,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:07,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6269728] [2021-11-05 13:45:07,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6269728] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:07,531 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:07,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-05 13:45:07,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3087538] [2021-11-05 13:45:07,532 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:07,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 13:45:07,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:07,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 13:45:07,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 13:45:07,533 INFO L87 Difference]: Start difference. First operand 3525 states and 4504 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:09,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:12,169 INFO L93 Difference]: Finished difference Result 6908 states and 8834 transitions. [2021-11-05 13:45:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 13:45:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-05 13:45:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:12,174 INFO L225 Difference]: With dead ends: 6908 [2021-11-05 13:45:12,174 INFO L226 Difference]: Without dead ends: 3507 [2021-11-05 13:45:12,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 396.20ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:45:12,178 INFO L933 BasicCegarLoop]: 4300 mSDtfsCounter, 35 mSDsluCounter, 21123 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4026.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 25423 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.58ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4260.36ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:12,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 25423 Invalid, 433 Unknown, 0 Unchecked, 18.58ms Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 4260.36ms Time] [2021-11-05 13:45:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2021-11-05 13:45:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3501. [2021-11-05 13:45:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.309900410076157) internal successors, (4472), 3500 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4472 transitions. [2021-11-05 13:45:12,241 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4472 transitions. Word has length 88 [2021-11-05 13:45:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:12,242 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4472 transitions. [2021-11-05 13:45:12,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4472 transitions. [2021-11-05 13:45:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-05 13:45:12,245 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:12,245 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:45:12,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-05 13:45:12,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:45:12,459 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2142844222, now seen corresponding path program 1 times [2021-11-05 13:45:12,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:12,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220630946] [2021-11-05 13:45:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:12,463 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:12,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:12,464 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:45:12,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-05 13:45:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:15,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-05 13:45:15,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:15,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:16,644 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:16,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220630946] [2021-11-05 13:45:16,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220630946] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:16,644 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:16,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-05 13:45:16,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278124344] [2021-11-05 13:45:16,645 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:16,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:45:16,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:45:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:45:16,645 INFO L87 Difference]: Start difference. First operand 3501 states and 4472 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:18,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:19,324 INFO L93 Difference]: Finished difference Result 6827 states and 8726 transitions. [2021-11-05 13:45:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 13:45:19,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-05 13:45:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:19,329 INFO L225 Difference]: With dead ends: 6827 [2021-11-05 13:45:19,329 INFO L226 Difference]: Without dead ends: 3513 [2021-11-05 13:45:19,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.88ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:45:19,334 INFO L933 BasicCegarLoop]: 4285 mSDtfsCounter, 4550 mSDsluCounter, 3945 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2491.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4550 SdHoareTripleChecker+Valid, 8230 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.35ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2573.37ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:19,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4550 Valid, 8230 Invalid, 94 Unknown, 0 Unchecked, 8.35ms Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 2573.37ms Time] [2021-11-05 13:45:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2021-11-05 13:45:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3501. [2021-11-05 13:45:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.3093145869947276) internal successors, (4470), 3500 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4470 transitions. [2021-11-05 13:45:19,399 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4470 transitions. Word has length 91 [2021-11-05 13:45:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:19,400 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4470 transitions. [2021-11-05 13:45:19,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4470 transitions. [2021-11-05 13:45:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-05 13:45:19,401 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:19,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:45:19,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-05 13:45:19,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:45:19,616 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1430476173, now seen corresponding path program 1 times [2021-11-05 13:45:19,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:19,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306080692] [2021-11-05 13:45:19,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:19,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:19,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:19,621 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:45:19,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-05 13:45:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:22,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:45:22,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:23,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:23,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:23,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306080692] [2021-11-05 13:45:23,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306080692] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:23,905 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:23,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-05 13:45:23,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662026471] [2021-11-05 13:45:23,905 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:23,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 13:45:23,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 13:45:23,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:45:23,906 INFO L87 Difference]: Start difference. First operand 3501 states and 4470 transitions. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:26,262 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:41,495 INFO L93 Difference]: Finished difference Result 9213 states and 11712 transitions. [2021-11-05 13:45:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:45:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-05 13:45:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:41,507 INFO L225 Difference]: With dead ends: 9213 [2021-11-05 13:45:41,507 INFO L226 Difference]: Without dead ends: 5859 [2021-11-05 13:45:41,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 272.74ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-05 13:45:41,514 INFO L933 BasicCegarLoop]: 4265 mSDtfsCounter, 17660 mSDsluCounter, 14287 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15405.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17660 SdHoareTripleChecker+Valid, 18552 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 59.65ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17129.83ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:41,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17660 Valid, 18552 Invalid, 2256 Unknown, 0 Unchecked, 59.65ms Time], IncrementalHoareTripleChecker [24 Valid, 2231 Invalid, 1 Unknown, 0 Unchecked, 17129.83ms Time] [2021-11-05 13:45:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5859 states. [2021-11-05 13:45:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5859 to 3501. [2021-11-05 13:45:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.3087287639132983) internal successors, (4468), 3500 states have internal predecessors, (4468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4468 transitions. [2021-11-05 13:45:41,632 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4468 transitions. Word has length 95 [2021-11-05 13:45:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:41,633 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4468 transitions. [2021-11-05 13:45:41,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4468 transitions. [2021-11-05 13:45:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-05 13:45:41,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:41,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:45:41,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-05 13:45:41,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:45:41,855 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash -887538217, now seen corresponding path program 1 times [2021-11-05 13:45:41,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:41,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055272013] [2021-11-05 13:45:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:41,860 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:41,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:45:41,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-05 13:45:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:44,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:45:44,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:45,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:46,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:46,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055272013] [2021-11-05 13:45:46,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055272013] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:46,712 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:46,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-05 13:45:46,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338127049] [2021-11-05 13:45:46,712 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:46,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 13:45:46,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 13:45:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:45:46,713 INFO L87 Difference]: Start difference. First operand 3501 states and 4468 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:48,958 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:45:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:45:50,771 INFO L93 Difference]: Finished difference Result 9408 states and 11986 transitions. [2021-11-05 13:45:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:45:50,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-05 13:45:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:45:50,781 INFO L225 Difference]: With dead ends: 9408 [2021-11-05 13:45:50,781 INFO L226 Difference]: Without dead ends: 6093 [2021-11-05 13:45:50,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 204.17ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 13:45:50,788 INFO L933 BasicCegarLoop]: 4260 mSDtfsCounter, 11324 mSDsluCounter, 7839 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3518.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11324 SdHoareTripleChecker+Valid, 12099 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.25ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3753.51ms IncrementalHoareTripleChecker+Time [2021-11-05 13:45:50,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11324 Valid, 12099 Invalid, 277 Unknown, 0 Unchecked, 19.25ms Time], IncrementalHoareTripleChecker [12 Valid, 264 Invalid, 1 Unknown, 0 Unchecked, 3753.51ms Time] [2021-11-05 13:45:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2021-11-05 13:45:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 3501. [2021-11-05 13:45:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.3081429408318688) internal successors, (4466), 3500 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4466 transitions. [2021-11-05 13:45:50,912 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4466 transitions. Word has length 103 [2021-11-05 13:45:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:45:50,912 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4466 transitions. [2021-11-05 13:45:50,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4466 transitions. [2021-11-05 13:45:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-05 13:45:50,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:45:50,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:45:50,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-05 13:45:51,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:45:51,131 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:45:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:45:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1529462664, now seen corresponding path program 1 times [2021-11-05 13:45:51,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:45:51,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019449193] [2021-11-05 13:45:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:45:51,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:45:51,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:45:51,139 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:45:51,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-05 13:45:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:45:54,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-05 13:45:54,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:45:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:55,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:45:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:45:56,248 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:45:56,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019449193] [2021-11-05 13:45:56,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019449193] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:45:56,248 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:45:56,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-05 13:45:56,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707705734] [2021-11-05 13:45:56,249 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:45:56,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:45:56,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:45:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:45:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:45:56,250 INFO L87 Difference]: Start difference. First operand 3501 states and 4466 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:45:58,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:46:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:46:09,734 INFO L93 Difference]: Finished difference Result 9432 states and 12014 transitions. [2021-11-05 13:46:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 13:46:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-11-05 13:46:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:46:09,743 INFO L225 Difference]: With dead ends: 9432 [2021-11-05 13:46:09,743 INFO L226 Difference]: Without dead ends: 6093 [2021-11-05 13:46:09,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 367.55ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-05 13:46:09,749 INFO L933 BasicCegarLoop]: 4222 mSDtfsCounter, 11552 mSDsluCounter, 10872 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11262.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11552 SdHoareTripleChecker+Valid, 15094 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 42.82ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12876.76ms IncrementalHoareTripleChecker+Time [2021-11-05 13:46:09,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11552 Valid, 15094 Invalid, 1362 Unknown, 0 Unchecked, 42.82ms Time], IncrementalHoareTripleChecker [27 Valid, 1334 Invalid, 1 Unknown, 0 Unchecked, 12876.76ms Time] [2021-11-05 13:46:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2021-11-05 13:46:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 3501. [2021-11-05 13:46:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.3075571177504393) internal successors, (4464), 3500 states have internal predecessors, (4464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4464 transitions. [2021-11-05 13:46:09,856 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4464 transitions. Word has length 115 [2021-11-05 13:46:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:46:09,857 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4464 transitions. [2021-11-05 13:46:09,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4464 transitions. [2021-11-05 13:46:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-05 13:46:09,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:46:09,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:46:09,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-05 13:46:10,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:46:10,072 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:46:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:46:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2133081764, now seen corresponding path program 1 times [2021-11-05 13:46:10,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:46:10,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487634779] [2021-11-05 13:46:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:46:10,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:46:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:46:10,076 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:46:10,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-05 13:46:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:46:13,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-05 13:46:13,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:46:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:14,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:46:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:15,588 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:46:15,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487634779] [2021-11-05 13:46:15,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487634779] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:46:15,588 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:46:15,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-11-05 13:46:15,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346718798] [2021-11-05 13:46:15,588 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:46:15,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 13:46:15,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:46:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 13:46:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 13:46:15,589 INFO L87 Difference]: Start difference. First operand 3501 states and 4464 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:17,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:46:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:46:27,630 INFO L93 Difference]: Finished difference Result 6867 states and 8762 transitions. [2021-11-05 13:46:27,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 13:46:27,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-11-05 13:46:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:46:27,636 INFO L225 Difference]: With dead ends: 6867 [2021-11-05 13:46:27,636 INFO L226 Difference]: Without dead ends: 3578 [2021-11-05 13:46:27,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 268.58ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 13:46:27,641 INFO L933 BasicCegarLoop]: 4264 mSDtfsCounter, 8821 mSDsluCounter, 7375 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10171.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8821 SdHoareTripleChecker+Valid, 11639 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.46ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11609.28ms IncrementalHoareTripleChecker+Time [2021-11-05 13:46:27,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8821 Valid, 11639 Invalid, 1188 Unknown, 0 Unchecked, 34.46ms Time], IncrementalHoareTripleChecker [5 Valid, 1182 Invalid, 1 Unknown, 0 Unchecked, 11609.28ms Time] [2021-11-05 13:46:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2021-11-05 13:46:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3501. [2021-11-05 13:46:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3414 states have (on average 1.30697129466901) internal successors, (4462), 3500 states have internal predecessors, (4462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4462 transitions. [2021-11-05 13:46:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4462 transitions. Word has length 123 [2021-11-05 13:46:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:46:27,745 INFO L470 AbstractCegarLoop]: Abstraction has 3501 states and 4462 transitions. [2021-11-05 13:46:27,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4462 transitions. [2021-11-05 13:46:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-05 13:46:27,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:46:27,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:46:27,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-05 13:46:27,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:46:27,968 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:46:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:46:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash -710973970, now seen corresponding path program 1 times [2021-11-05 13:46:27,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:46:27,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857717517] [2021-11-05 13:46:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:46:27,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:46:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:46:27,973 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:46:27,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-05 13:46:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:46:31,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 1873 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 13:46:31,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:46:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:31,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:46:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:46:31,822 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:46:31,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857717517] [2021-11-05 13:46:31,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857717517] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:46:31,823 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:46:31,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-05 13:46:31,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077681896] [2021-11-05 13:46:31,823 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:46:31,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 13:46:31,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:46:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 13:46:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 13:46:31,824 INFO L87 Difference]: Start difference. First operand 3501 states and 4462 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 13:46:43,754 INFO L93 Difference]: Finished difference Result 7615 states and 9791 transitions. [2021-11-05 13:46:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 13:46:43,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2021-11-05 13:46:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 13:46:43,761 INFO L225 Difference]: With dead ends: 7615 [2021-11-05 13:46:43,761 INFO L226 Difference]: Without dead ends: 4161 [2021-11-05 13:46:43,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.07ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 13:46:43,766 INFO L933 BasicCegarLoop]: 4735 mSDtfsCounter, 978 mSDsluCounter, 6746 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10460.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 11481 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 35.53ms SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11631.99ms IncrementalHoareTripleChecker+Time [2021-11-05 13:46:43,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 11481 Invalid, 2487 Unknown, 0 Unchecked, 35.53ms Time], IncrementalHoareTripleChecker [525 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 11631.99ms Time] [2021-11-05 13:46:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2021-11-05 13:46:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 3765. [2021-11-05 13:46:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3678 states have (on average 1.2849374660141382) internal successors, (4726), 3764 states have internal predecessors, (4726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 4726 transitions. [2021-11-05 13:46:43,851 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 4726 transitions. Word has length 139 [2021-11-05 13:46:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 13:46:43,851 INFO L470 AbstractCegarLoop]: Abstraction has 3765 states and 4726 transitions. [2021-11-05 13:46:43,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:46:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 4726 transitions. [2021-11-05 13:46:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-05 13:46:43,853 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 13:46:43,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 13:46:43,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-05 13:46:44,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-05 13:46:44,068 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 84 more)] === [2021-11-05 13:46:44,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 13:46:44,068 INFO L85 PathProgramCache]: Analyzing trace with hash 977969772, now seen corresponding path program 1 times [2021-11-05 13:46:44,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-05 13:46:44,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596867458] [2021-11-05 13:46:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 13:46:44,071 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-05 13:46:44,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-05 13:46:44,072 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-05 13:46:44,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-05 13:47:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 13:47:14,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-05 13:47:14,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 13:47:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:47:16,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 13:47:17,302 INFO L354 Elim1Store]: treesize reduction 49, result has 42.4 percent of original size [2021-11-05 13:47:17,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 47 [2021-11-05 13:47:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 13:47:18,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-05 13:47:18,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596867458] [2021-11-05 13:47:18,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596867458] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-05 13:47:18,341 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-05 13:47:18,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 7] imperfect sequences [] total 14 [2021-11-05 13:47:18,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806230999] [2021-11-05 13:47:18,341 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-05 13:47:18,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-05 13:47:18,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-05 13:47:18,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-05 13:47:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-05 13:47:18,342 INFO L87 Difference]: Start difference. First operand 3765 states and 4726 transitions. Second operand has 14 states, 14 states have (on average 12.928571428571429) internal successors, (181), 14 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 13:47:20,541 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 13:47:22,556 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15